给二叉树的某个节点，返回该节点的后继节点

听风客1

于 2024-07-30 19:02:38 发布

阅读量276

点赞数 3

文章标签： java 数据结构算法

本文链接：https://blog.csdn.net/2401_83010439/article/details/140804223

版权

public class test17 {
    public static class Node{
        int value;
        Node left;
        Node right;
        Node parent;
    }

    public static Node getSuccessorNode(Node node){
        if(node == null){
            return node;
        }
        if(node.right != null){
            return getLeftMost(node.right);
        }else{
            Node parent = node.parent;
            while (parent != null && parent.right == node){
                node = parent;
                parent = node.parent;
            }
            return parent;
        }
    }

    public static Node getLeftMost(Node node){
        if(node == null){
            return node;
        }
        while (node.left != null){
        node = node.left;
        }
        return node;
    }
}