binary search tree impelementation and java

Question

I am trying to implement BST algorithm using Cormen\'s pseudo code yet having issue.

Here is my Code for Node:

public class Node {
    Node left;
            


        

Answer 1

...what is up with your delete code? It doesn't make a lot of sense. I would consider rewriting it in a more logical way. Without the meaningless single-letter variable names. And add comments!

One possible algorithm is:

Get the parent of the node to delete
Get the right-most node of the left subtree, or the leftmost node of the right subtree
Remove the node to delete and replace it with the node you found
Rebalance the tree

...or, if you want to hack up this stuff so it's right, I'd start looking at the

if (x != null){
    Node tmp = getParent(t,x);
    tmp = getParent(t,y);
}

part, because that's clearly wrong.