How to delete a node from binary search tree in java

Previous
Next

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.

In this post, we will see how to delete a node from binary search tree.

There are two parts to it.
  • Search the node
  • After searching that node, delete the node.
There are three cases which we may need to consider while deleting a node from binary search tree.
  • If node has no child
  • If node has one child
  • If node has two children.

If node has no child

It is pretty straight forward case. We need to search the node and make it null.

Delete node of Binary Search tree with no child

If node has one children

If node have one children then we need to connect parent of removed node directly to child of the removed node.

Delete node of Binary Search tree with one child

If node has two children

It is complicated case. If it has two nodes, we need to connect parent of node to the leftmost node(minimum) of right sub tree or rightmost node(maximum) of left subtree.
Lets understand this case with example:
Delete node of Binary Search tree with two child

As you can see, we are replacing node 40 with node 50. Node 50 is minimum element in right subtree of 40 and deleting node 50 after moving as there will duplicate nodes.

Why minimum element of right sub tree?

Here we are using binary search tree property that tree can be represented in multiple ways.

For example:

Binary Search tree representation

We are using same property while deleting nodes with two children.

Complete java program:

When you run above program, you will get following output:

Previous
Next

Join Our News Letter - Stay Updated

Subscribe to Awesome Java Content.

2 Comments

  1. Parikksit Bhisay March 8, 2017
  2. Kasi April 17, 2017

Add Comment

Join Our News Letter - Stay Updated

Subscribe to Awesome Java Content.
You can like our facebook page Java2blog