Examine the following binary search tree and answer the question, nodes are valu

Question

Examine the following binary search tree and answer the question, nodes are values in the key members of the items in the tree. What is the minimum height of a binary search tree containing these nodes? What is the maximum height of a binary search tree containing these nodes? Show the order in which the nodes in the tree are processed by a postorder traversal of the tree? If a node with key value 25 is to be inserted into the tree, where would it be inserted? If node with key value 47 is to be deleted, which value could be used to replace 47? If node with key 29 is to be deleted, what replaces the pointer to node with key 29? If node with key 49 is to be deleted, what replaces the pointer to node with key 49? Show the order in which the nodes in the tree are processed by a preorder traversal of the tree.

Explanation / Answer

1. 2

2. 6

3. 29,22,52,49,47,69,56

4. left of 29

5. 29

6. no need to replace bcz it is leaf node

7. 52

8. 56, 47, 22, 29, 49, 52, 69

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.