Which of the following statements about a binary search tree is correct?
A)You can specify an insert position for inserting a node in the tree.
B)Locating an element in a balanced binary search tree takes O(n) time.
C)The speed of inserting or removing a node is dependent on the shape of the tree.
D)Adding elements that are already sorted will result in a balanced binary search tree.

Question

Quizplus · Accepted Answer

The speed of inserting or removing a node in a binary search tree is dependent on the shape of the tree. If the tree is unbalanced, inserting or removing a node may take O(n) time. Balancing the tree can improve the performance of these operations. The other statements are incorrect; you cannot specify an insert position for a binary search tree, locating an element in a balanced binary search tree takes O(log n) time, and adding elements that are already sorted can result in an unbalanced binary search tree.

Which of the Following Statements About a Binary Search Tree