本文详细介绍了如何在LeetCode的第235题中找到二叉搜索树中两个给定节点的最低公共祖先。通过解析问题定义，提供了一个有效解决方案，并给出了示例来解释算法的工作原理。
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 p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”
Given binary search tree: root = [6,2,8,0,4,7,9,null,null,3,5]
Example 1:
Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
订阅专栏 解锁全文
扫一扫
609
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
