C++ What is the depth of node holding key value 18? Determine the height of the

Question

C++

What is the depth of node holding key value 18? Determine the height of the tree. How many internal nodes are there in this tree? How many external nodes are there in this tree? List the "order of visit'' resulting from a Pre-Order Traversal method starting from the Root node List the " order of visit" resulting from an In-Order Traversal method starting from the node holding the key value 84 List the "order of visit" resulting from a Post-Order Traversal method starting from the Root node.

Explanation / Answer

Depth of node holding key value 18 4 Height of tree 7 How many internal node are there in this tree? 13 …nodes which are not leaf node How many external node are there in this tree? No of leaf nodes= external nodes 11 Preorder traversal (Node->left->right) 50 32 7 4 29 18 40 36 43 56 84 60 58 57 59 82 63 61 75 83 94 87 92 97 In-order traversal (left->node->right) key value 84 57 58 59 60 61 63 75 82 83 84 87 92 94 97 Post order (left->right->node) key value root 4 18 29 7 36 43 40 32 57 59 58 61 75 63 83 82 60 92 87 97 94 84 56

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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