Section Break Continuous) Complete the following Binary Search Tree traversal co

Question

Section Break Continuous) Complete the following Binary Search Tree traversal code. 1. Binary Tree Traversal Preorder, Inorder root-left = insert(root->left, data); Postorder/ #include using namespace std; 45. else 2. 3. 47 um root 5. struct aNode ( 50. int main0 aNode* root NULL root = insert(root,'N'); root Insert root, A); 10. h 12. void Preorder(struct aNode root) 13 14. 15, Insert node &J;' if(rootNULL) return; cout right); 16 18 19 20. void Inorder(aNode root) ( /Print Nodes in Inorder cout

Explanation / Answer

1) struct aNode { char data; aNode *left; aNode *right; }; 2) Inorder(root->left); cout left = NULL; root->right = NULL; 4) root->right = Insert(root->right, data); 5) root = Insert(root, 'C'); root = Insert(root, 'J');

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

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