Which of the Following Statements About a Binary Search Tree

Multiple Choice

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.