题目描述
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]
题目链接
https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
方法思路
Approach1:
class Solution {
//Runtime: 5 ms, faster than 100.00%
//Memory Usage: 33 MB, less than 96.87%
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(find(p, q.val)) return p;
if(find(q, p.val)) return q;
while(root != null){
if(find(root.left, p.val) && find(root.left, q.val)){
root = root.left;
continue;
}
if(find(root.right, p.val) && find(root.right, q.val))
root = root.right;
else
return root;
}
return null;
}
public boolean find(TreeNode root, int val){
if(root == null) return false;
if(root.val == val) return true;
return find(root.left, val) || find(root.right, val);
}
}
Approach2:recursive
public class Solution {
//Runtime: 6 ms, faster than 75.86%
//Memory Usage: 33.6 MB, less than 83.96%
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root == null || 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;
return left != null ? left : right;
}
}