LeetCode 236. Lowest Common Ancestor of a Binary Tree（二叉树的最低公共祖先）_二叉树两个子节点的最低公共父节点 leetcode-CSDN博客

本文链接：https://blog.csdn.net/jmspan/article/details/51071717

原题网址：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

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).”

        _______3______
       /              \
    ___5__          ___1__
   /      \        /      \
   6      _2       0       8
         /  \
         7   4

For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.

思路：递归遍历二叉树，时间复杂度O(n)

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private TreeNode lca;
    private int find(TreeNode root, TreeNode p, TreeNode q) {
        if (root == null || lca != null) return 0;
        int found = 0;
        if (root.left != null && lca == null) found += find(root.left, p, q);
        if (root.right != null && lca == null) found += find(root.right, p, q);
        if (root == p) found ++;
        if (root == q) found ++;
        if (found == 2 && lca == null) lca = root;
        return found;
    }
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        find(root, p, q);
        return lca;
    }    
}