题解 | #在二叉树中找到两个节点的最近公共祖先#

JavaScript实现

function lowestCommonAncestor(root, o1, o2) {
    // write code here
    var dfs = function (root, p, q) {
        if (root == null || root.val == p || root.val == q) {
            return root;
        }
        var left = dfs(root.left, p, q);
        var right = dfs(root.right, p, q);
        if (left && right) {
            return root;
        } else {
            return left ? left : right;
        }
    };
    var res = dfs(root, o1, o2);
    return res.val;
}

参考 https://leetcode-cn.com/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/solution/mian-shi-ti-68-ii-er-cha-shu-de-zui-jin-gong-gon-7/