Java 红黑树-打印错误

我试图实现红黑树后，研究了它，但得到错误，而打印红黑树。请您看一下，并建议在红黑树插入的实现中是否有任何错误。 它只递归地显示root及其第一个左、右子级，然后显示以下错误：

Exception in thread "main" java.lang.StackOverflowError
at java.io.FileOutputStream.write(FileOutputStream.java:326)
at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82)
at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140)
at java.io.PrintStream.write(PrintStream.java:482)
at sun.nio.cs.StreamEncoder.writeBytes(StreamEncoder.java:221)
at sun.nio.cs.StreamEncoder.implFlushBuffer(StreamEncoder.java:291)
at sun.nio.cs.StreamEncoder.flushBuffer(StreamEncoder.java:104)
at java.io.OutputStreamWriter.flushBuffer(OutputStreamWriter.java:185)
at java.io.PrintStream.write(PrintStream.java:527)
at java.io.PrintStream.print(PrintStream.java:669)
at java.io.PrintStream.println(PrintStream.java:806)
at RedBlackTree.preOrder(RedBlackTree.java:161)
at RedBlackTree.preOrder(RedBlackTree.java:162)
at RedBlackTree.preOrder(RedBlackTree.java:162)
at RedBlackTree.preOrder(RedBlackTree.java:163)

最后两行错误重复多次

对于print命令，我使用简单的预排序递归代码。 代码如下：

public class RedBlackTree {

public RBNode root;

void leftRotate(RBNode node)
{
    RBNode y;
    y = node.right;
    if(y.left != null)y.left.parent = node;
    y.parent = node.parent;

    if(node.parent == null)root = y;
    else
    {
        if(node == node.parent.left)node.parent.left = y;
        else node.parent.right =y;
    }
    y.left = node;
    node.parent = y;
}

void rightRotate(RBNode node)
{
    RBNode y;
    y = node.left;
    if(y.right != null)y.right.parent = node;
    y.parent = node.parent;

    if(node.parent == null)root = y;
    else
    {
        if(node == node.parent.right)node.parent.right = y;
        else node.parent.left =y;
    }
    y.right = node;
    node.parent = y;
}

void insertNode(RBNode node, RBNode data)
{
    // INSERT IN ROOT
    if(node == null)
    {
        node = new RBNode(data.key);
        root = node;
        root.color = 0;
        System.out.println("Root " + root.key);

    }

    else if (data.key < node.key && node.left == null)
    {

        node.left = data;
        data.parent = node;



    }
    else if(data.key >node.key && node.right == null)
    {

        node.right  = data;
        data.parent = node;


    }

    else{
        if(data.key < node.key)insertNode(node.left, data);
        else insertNode(node.right, data);
    }

    data.color = 1;


    RBNode uncle;
    //Check REB BLACK PROPERTIES

    while(data.parent != null && data.parent.color ==1 && data != root && data.color != 0)
    {
                System.out.println("Data " + data.key + " Parent " + data.parent.key);

                //PARENT IS RIGHT CHILD
                if(data.parent == data.parent.parent.right)
                {
                    System.out.println("Parent RIGHT");
                    uncle = data.parent.parent.left; 
                    if(uncle == null) System.out.println("Uncle is null");

                    //UNCLE IS BLACK OR NULL
                    if(uncle == null || uncle.color == 0)
                    {
                        System.out.println("Uncle BLACK or NULL");
                        if(data == data.parent.left)
                        {
                            System.out.println("Node is LEFT");
                            data = data.parent;
                            rightRotate(data);
                        }
                        data.parent.color = 0;
                        if(data.parent.parent.key != root.key)data.parent.parent.color = 1;
                        leftRotate(data.parent.parent);
                    }
                    //UNCLE IS RED
                    else
                    {
                        System.out.println("Uncle RED");
                        data.parent.parent.left.color = 0;
                        data.parent.color = 0;
                        if(data.parent.parent.key != root.key)data.parent.parent.color = 1;
                        data = data.parent;
                    }


                }
                // PARENT IS LEFT CHILD
                else
                {
                    System.out.println("Parent LEFT");
                    uncle = data.parent.parent.right; 
                    //UNCLE IS NULL OR BLACK
                    if(uncle ==null || uncle.color == 0)
                    {
                        System.out.println("Uncle BLACK or NULL");
                        System.out.println("");
                        if(data == data.parent.right)
                        {
                            System.out.println("Node is RIGHT");
                            data = data.parent;
                            leftRotate(data);
                        }
                        data.parent.color = 0;
                        if(data.parent.parent.key != root.key)data.parent.parent.color = 1;
                        rightRotate(data.parent.parent);    
                    }
                    //UNCLE IS RED
                    else
                    {
                        System.out.println("Uncle RED");

                        data.parent.parent.right.color = 0;
                        data.parent.color = 0;
                        if(data.parent.parent.key != root.key)data.parent.parent.color= 1;
                        data = data.parent;
                    }

                }


    }
    root.color = 0;

}

void preOrder(RBNode node)
{
    if(node != null)
    {
        System.out.println("Value : " + node.key + "Color: " + node.color);
        preOrder(node.left);
        preOrder(node.right);
    }
}

public static void main(String args[])
{
    RedBlackTree tree = new RedBlackTree();
    tree.insertNode(tree.root, new RBNode(2));
    tree.insertNode(tree.root, new RBNode(1));
    tree.insertNode(tree.root, new RBNode(4));
    tree.insertNode(tree.root, new RBNode(5));
    tree.insertNode(tree.root, new RBNode(9));
    tree.insertNode(tree.root, new RBNode(3));
    tree.insertNode(tree.root, new RBNode(6));

    tree.insertNode(tree.root, new RBNode(7));


    tree.preOrder(tree.root);
  }


}

class RBNode
{
 int key; 
 RBNode parent;
 RBNode left;
 RBNode right;
 int color;  // 1 = RED , 0 = BLACK
public RBNode(int key)
 {
    this.key = key;
    this.parent = null;
    this.left = null;
    this.right = null;


 }
}

公共类RedBlackTree{
公共节点根；
void leftRotate（RBNode节点）
{
rby节点；
y=节点。右侧；
如果（y.left！=null）y.left.parent=node；
y、 parent=node.parent；
如果（node.parent==null）root=y；
其他的
{
如果（node==node.parent.left）node.parent.left=y；
else node.parent.right=y；
}
y、 左=节点；
node.parent=y；
}
void rightRotate（RBNode节点）
{
rby节点；
y=节点。左；
如果（y.right！=null）y.right.parent=node；
y、 parent=node.parent；
如果（node.parent==null）root=y；
其他的
{
如果（node==node.parent.right）node.parent.right=y；
else node.parent.left=y；
}
y、 右=节点；
node.parent=y；
}
void insertNode（RBNode节点，RBNode数据）
{
//插入根目录
if（node==null）
{
节点=新的RBNode（data.key）；
根=节点；
root.color=0；
System.out.println（“Root”+Root.key）；
}
else if（data.keynode.key&&node.right==null）
{
node.right=数据；
data.parent=节点；
}
否则{
if（data.key

---

插入实现是否错误？

我能够解决该特定错误，因此代码仍然没有给出完整的正确答案。由于Left和Ri的错误实现，出现了错误

void leftRotate(RBNode node)
{
    RBNode y;
    y = node.right;
    node.right = y.left;

    if(y.left != null)y.left.parent = node;

    y.parent = node.parent;

    if(node.parent == null)root = y;
    else
    {
        if(node == node.parent.left)node.parent.left = y;
        else node.parent.right =y;
    }
    y.left = node;
    node.parent = y;
}

void rightRotate(RBNode node)
{
    RBNode y;
    y = node.left;
    node.left = y.right;
    if(y.right != null)y.right.parent = node;

    y.parent = node.parent;

    if(node.parent == null)root = y;
    else
    {
        if(node == node.parent.right)node.parent.right = y;
        else node.parent.left =y;
    }
    y.right = node;
    node.parent = y;
}