Plz help it\'s for final carefully are the structure with problem template and a

Question

Plz help it's for final carefully are the structure with problem template and answer them. Following codes are parts of for deleting a node. cclass T> class b private: struct treeNode T value; The value in the node tree Node .left: Pointer to left child node treeNode rights 1/ Pointer to right child node tree Node .root; Pointer to the root node void insert treeNode treeNode .&) Private member functions void destroysubTreectreeNode void deleteNodeCT. treeNode .&); Public: binary Tree roots NULL: destroy subTreeCroot); void insert Node (T) bool sa CT); tree Node renova (int value treeNode void display Inorder(treeNode const void displayPreorder tree Node const void displayPostorder treeNode const; void iterative Preorder CtreeNode const templatecclass T> void binaryTree remove (treeNode .&tree;) if (value this- value) if (left NULL) return left- remove (value. this) else return NULL: else if (value this- value) if (right NULL) return right- reaove (value, this): else return NULL: else if (left NULL kk right NULL) this- value right- minvalue return right- remove (this->value, this); else if (parent- left this) Parent- left (left NULL) left right; return this: else if (parent->right this) Parent-right (left NULL) left right return this;

Explanation / Answer

For deleting all the nodes in a binary search tree, first we have three ways similar to displaying the nodes.

Out of these only post order deletion is possible, because in preorder deletion we first delete the root node then we can't access it's child. In inorder deletion also we first delete all the left child and then all the root nodes,so we can't access the right child. So, only possible way is postorder deletion. Here we first delete left child then right child and then we delete the root nodes.

postorder deletion:

}

}

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

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