LeetCode 235. Lowest Common Ancestor of a Binary Search Tree

最新推荐文章于 2024-02-06 06:38:28 发布

zjxxyz123

最新推荐文章于 2024-02-06 06:38:28 发布

阅读量96

点赞数

分类专栏： LeetCode 文章标签： LeetCode 二叉搜索树最近公共祖先

本文链接：https://blog.csdn.net/zjxxyz123/article/details/80071266

版权

LeetCode 专栏收录该内容

133 篇文章 1 订阅

订阅专栏

问题描述

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”
Example :
地址

问题分析

在一棵二叉搜索树上找两个节点的最近公共祖先，必须利用二叉搜索树的性质：左子树节点全部小于根节点，右子树节点全部大于跟节点，并且左右子树又是二叉搜索树。
分三种情况讨论
- 两节点值小于根节点值，那么最近公共祖先一定在左子树中
- 两节点值大于根节点值，那么最近公共祖先一定在右子树中
- 其他情况，最近公共祖先是根节点

代码实现

递归

public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if (root == null || p == null || q == null) {
            return null;
        }
        if (p.val < root.val && q.val < root.val) {
            return lowestCommonAncestor(root.left, p, q);
        }else if (p.val > root.val && q.val > root.val) {
            return lowestCommonAncestor(root.right, p, q);
        }else {
            return root;
        }
    }

迭代

public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if (root == null || p == null || q == null) {
            return null;
        }
        TreeNode pRoot = root;
        while(true) {
            if (p.val < pRoot.val && q.val < pRoot.val) {
                pRoot = pRoot.left;
            }else if (p.val > pRoot.val && q.val > pRoot.val) {
                pRoot = pRoot.right;
            }else {
                return pRoot;
            }
        }
    }