An operation that can be performed on a binary search tree is
A) insertion of new value.
B) searching the tree for the occurrence of a given value.
C) removing a value stored in the tree.
D) All of the above
E) None of the above

Question

Quizplus · Accepted Answer

All three operations (insertion, searching, and removal) can be performed on a binary search tree. Insertion involves finding the appropriate location to add a new node while preserving the binary search tree properties. Searching involves traversing the tree by comparing the search key with the values stored in the nodes. Removal involves finding the node to remove, replacing it with its successor or predecessor (depending on whether it has one or two children), and adjusting the tree to preserve the binary search tree properties.

An Operation That Can Be Performed on a Binary Search