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

Extracted text: Suppose 1,000 integer elements are generated at random and are inserted into a sorted linked list and a binary search tree (BST) separately. Considering the efficiency of searching for an element in the two structures, which of the following statements is true? The search operation on the BST takes shorter time because it is relatively balanced. O None of these The search operation on the list takes longer time because the numbers are not sorted. The search operation on the BST longer time because the numbers are not sorted. O The search operation will take the same time in both structures.


Extracted text: Thinking about binary search tree methods, e.g., add, size, inOrder, which of the following statements is true about the iterative solutions and the recursive solutions? None of these Iterative solutions do not always work, especially when the BST is very skewed. Both iterative and recursive solutions do not work when the BST is very large and skewed. When time complexities are the same, recursive solutions are preferred and always work. When properly implemented, both iterative and recursive solutions are equally good.