Stack Overflow works best with JavaScript enabled.

Mar 07, The code works well for a leaf node (no children) and node with one child, but every time when it tries to delete a node with 2 children it will delete a whole sub-tree. struct Node { string key; string otherdata; Node left; Node right; }; typedef Node bst; the above are declared structure for bst.

Aug 18, Optimization to above code for two children case: In the above recursive code, we recursively call delete for the successor. We can avoid recursive calls by keeping track of the parent node of the successor so that we can simply remove the successor by making the child of a parent NULL. We know that the successor would always be a leaf node. Jan 03, Deleting the node with two child nodes: Here the node to be deleted has two child nodes. So, we will use in the order form of the tree, here we will delete the element and select its inorder neighbor for its place and recreate the rest.

Example, Deleting 5 from the BST will return the following tree. Recursive Solution. The idea is to traverse the tree in a postorder fashion and delete the left and right subtree of a node before deleting the node itself. Note that we cannot traverse a tree in preorder or inorder fashion as we can’t delete a parent before deleting its children. Following is the C++ program that demonstrates it: C++.

C++. 1. 2. Apr 11, Because we would abandon its sub tree as well. To delete a node with only 1 child, we can link its parent node to its only child.

Asked 3 years, 5 months ago.

For example, if we want to delete 7 in the above BST, we can link 5 to its only child 9, and remove the node 7. In other words, the sub tree of the to-be-deleted node will be re-attached and the properties of BST will be still valid. Delete a node with 2 children. The most complex situation is to delete a node with 2 children.

To transform first tree into second one, we can do following: choose minimum element from the right subtree (19 in the example); replace 5 by 19; hang 5 as a left child. The same approach can be utilized to remove a node, which has two children: find a minimum value in the right subtree; factorio construction robots clear trees value of the node to be removed with found minimum.

Now, right subtree contains a duplicate! apply remove to the right subtree to remove a duplicate. Notice, that the node.

Thanks for your responce.

Jun 11, Now how to delete an entire tree without using recursion. This could easily be done with the help of Level Order Tree Traversal. The idea is for each dequeued node from the queue, delete it after queuing its left and right nodes (if any).

The solution will work as we are traverse all the nodes of the tree level by level from top to bottom, and.