Consider this binary search tree:. 14 / \ 2 16 / \ 1 5 / 4
Suppose we remove the root, replacing it with something from the left subtree. What will be the new root?
(a) 2
(b) 1
(c) 5
(d) 4
(e) 16

Suppose the root of the binary search tree is removed, and replaced with the next node in the left subtree, then the new root will be 2.

The Binary search tree makes use of the root and has left and right sub trees which are used for insertion after they have been sorted and this is done based on the value of the root.

From the complete image, we can see that the binary search tree is more detailed and is pre-order in traversal mode with the values being: 14, 2, 1, 5, 4, 16

We should note that the root of this node is 14 and when using pre-order traversal, if the root 14 is eliminated, then the new root from the left sub tree would be 2.

Read more about binary search tree here:

link

The new root will be 2.

Explanation:

The binary tree is not properly presented (See attachment)

To answer this; first, we need to order the nodes of the tree in a pre-order traversal.

We use pre-order because the question says if something is removed from the left child.

So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.

The root of the binary tree is 14 and if 14 is removed, the next is 2.

Hence, the new root will be 2.