查找二叉树前驱结点、后继结点

最新推荐文章于 2024-04-18 11:06:01 发布

VipPeterGee

最新推荐文章于 2024-04-18 11:06:01 发布

阅读量559

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/sinat_35241409/article/details/123246129

版权

leetcode 链表算法二叉树

LeetCode 专栏收录该内容

58 篇文章 1 订阅

订阅专栏

题目

查找二叉树前驱结点、后继结点

解法

构建二叉树

public class BSTNode<T extends Comparable<T>> {
    T key;
    BSTNode<T> left;
    BSTNode<T> right;
    BSTNode<T> parent;

    public BSTNode(T key, BSTNode<T> parent, BSTNode<T> left, BSTNode<T> right) {
        this.key = key;
        this.parent = parent;
        this.left = left;
        this.right = right;
    }
}

查找二叉树前驱结点

    /**
     * 查找当前结点的前驱结点
     *
     * @param node
     * @return
     */
    public BSTNode<T> findHeadNode(BSTNode<T> node) {
        if (node.left != null) {
            BSTNode<T> left = node.left;
            // 左子树最右结点
            while (left.right != null) {
                left = left.right;
            }
            return left;
        } else {
            // 当前结点为父节点的右子结点
            BSTNode<T> parent = node.parent;
            while (parent != null && parent.right != node) {
                node = parent;
                parent = node.parent;
            }
            return parent;
        }
    }

查找二叉树后继结点

   /**
     * 查找结点的后继结点
     *
     * @param node
     * @return
     */
    public BSTNode<T> findTailNode(BSTNode<T> node) {
        // 查找右子树最左节点
        if (node.right != null) {
            BSTNode<T> right = node.right;
            while (right.left != null) {
                right = right.left;
            }
            return right;
        } else {
            // 当前结点为父节点的左子节点
            BSTNode<T> parent = node.parent;
            while (parent != null && parent.left != node) {
                node = parent;
                parent = node.parent;
            }
            return parent;
        }
    }