Question

How do I delete a node in a binary search tree with a java implementation?

Specifically with

public BTNode<Pair<Integer,String>>
delete
(BTNode<Pair<Integer,String>> aNode)
{

}

Answer 1

Below is the answer of your problem

You can use this function in your Code. I hope this fuction can solve your problem.

public BTNode(BTNode root, Integer data) {

if(root == null) return root;

if(data < root.getData()) {
root.Left(deleteNode(root.Left(), data));
} else if(data > root.Data()) {
root.Right(deleteNode(root.Right(), data));
} else {

if(root.Left() == null && root.Right() == null) {
System.out.println("deleting "+data);
return null;
} else if(root.Left() == null) {

System.out.println("deleting "+data);
return root.Right();
} else if(root.Right() == null) {

System.out.println("deleting "+data);
return root.Left();
} else {

Integer minValue = minValue(root.Right());
root.Data(minValue);
root.Right(deleteNode(root.Right(), minValue));
System.out.println("deleting "+data);
}
}

return root;
}

If you have any query please comment below

Please give a thumbs up.