Leetcode--树

236. 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 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 the following binary tree:  root = [3,5,1,6,2,0,8,null,null,7,4]

 

Example 1:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
Output: 3

Example 2:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
Output: 5
Explanation: The LCA of nodes

 有三种情况：

1. p和q分别在root的左右两边

2. p和q都在root的左边

3. p和q都在root的右边

 

从root开始搜索，如果左边找到了p，右边也找到了q,那么他们的公共最低根节点就是root

如果只在左边找到了p或者q,则root节点是p或者q

如果只在右边找到了p或者q,则root节点是p或者q

 

class Solution {
public:
  	TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
		if (root == NULL)return NULL;
		if (root == p || root == q)return root;

		TreeNode* left = lowestCommonAncestor(root->left, p, q);
		TreeNode* right = lowestCommonAncestor(root->right, p, q);

		if (left != NULL && right != NULL)return root;
		else if (left != NULL)return left;
		else if (right != NULL) return right;
		
        return NULL;
	}
};