Suppose 1,000 integer elements are generated at random and are inserted into a sorted linked list and a binary search tree (BST) separately. Compare the efficiency of searching for an element in the two structures. Explain your answer.

Binary search tree is better than sorted linked for searching in terms of complexity and efficiency.

Explanation:

In sorted linked list, the complexity of algorithm has been increased in terms of time for searching operation as compared to binary search tree for up to 1000 integer elements.

In sorted linked list, it varies with the position of searching element. If the searching element is present in the start of the linked list then it takes small amount of time. But if the searching element is present at 999 or 1000 location which is commonly known as worst case scenario in case of linked list. It takes a lot of time to search the element at that position.

In binary search tree, the 1000 element has been divided in to two major wings known as left node and right node. The complexity of this type of search is depends on the height of tree. If number of elements on both left and right side of the wing are almost equal then it takes almost half time to search an element than in sorted linked in worst case scenario.

As linked list has linear search algorithm while BST has binary search algorithm so it takes half amount of time and has been more efficient than Sorted Linked List.

o an

you go to add your answer type bewteen 5000 and 20 characters and can only have 2 people answer on 1 question.your challanges are based on your questions.