Question

suppose 1000 integer elements are inserted in order, from largest to smallest, into a sorted linked list and a binary search tree. compare the efficiency of searching for an element in the two structures

Answer 1

The binary search tree is better than the sorted link with respect to efficiency and intricacy.

Comparing a sorted linked list to a binary search tree for up to 1000 integer members, the intricacy of the algorithm in the sorted linked list grows over time. It differs depending on where the seeking element is located in sorted links. It requires little time if the searching element is present at the beginning of the linked list. However, in a linked list, the worst-case scenario occurs if the seeking element is present at 1000. Searching for the element in that position takes a long time.

The 1000 elements in a binary search split into two main wings. This type of search varies in difficulty depending on tree height. In the worst situation, if there are about equal numbers of elements on the left and right sides of the wing, searching for an element takes about half as long as searching for it in sorted links. Binary is more effective than Sorted as it uses a binary search algorithm instead of the linear search technique used by linked lists.

Read more about binary search trees on:

brainly.com/question/28388846

#SPJ4