Examine the following binary search tree and answer the questions in Exercises 3

Question

Examine the following binary search tree and answer the questions in Exercises 36-39. The numbers on the nodes are labels so that we can talk about the nodes; they are not key values within the nodes. If an element is to be inserted whose key value is less than the key value in node 1 but greater than the key value in node 5, where would it be inserted? If node 1 is to be removed, the value in which node could be used to replace it? 4 2 7 5 1 6 8 3 is a traversal of the tree in which order? 1 2 4 5 7 3 6 8 is a traversal of the tree in which order?

Explanation / Answer

37) The value of 3rd node could be used to replace node 1.

38) Traversal of the tree is in Inorder.

39) Traversal of the tree is Preorder.

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---