LC.P235[二叉搜索树的最近公共祖先]

发表于2023-08-25|更新于2023-09-06|LeetCode

|字数总计:111|阅读时长:1分钟|阅读量:

方法一：DFS

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        int x = root.val;
        if (p.val < x && q.val < x) return lowestCommonAncestor(root.left, p, q);
        if (p.val > x && q.val > x) return lowestCommonAncestor(root.right, p, q);
        return root;
    }
}