To add a new element X to a binary search tree:
A) if the tree is empty,make X the root of a new tree;otherwise,compare X to the root,if X is less,put it in the left subtree,if it is greater,put in the right subtree
B) First add X in the position of the root.If X is a leaf,or is less than its children,stop.Otherwise,repeatedly swap X with the smaller of its two children until X becomes a leaf,or becomes less than its children.
C) Add X as a leaf,taking care to preserve the completeness of the heap.If X is now the root,or is greater than its parent,stop.Otherwise,repeatedly swap X with its parent until X becomes the root,or becomes greater than its parent.
D) insert X using the same algorithm for insertion in a binary search tree.If the tree remains balanced,stop.Otherwise,execute a rebalancing operation.

Question

Quizplus · Accepted Answer

This is the standard algorithm for adding a new element to a binary search tree, as it maintains the property of a binary search tree by placing the new element in the appropriate subtree based on its value compared to the root. Choices B and C are algorithms specific to heaps, while D involves balancing operations that may not be necessary for a simple binary search tree.

To Add a New Element X to a Binary Search