题目描述
解题思路
参考K神:剑指 Offer 68 - II. 二叉树的最近公共祖先(DFS ,清晰图解)
代码实现
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @param {TreeNode} p
* @param {TreeNode} q
* @return {TreeNode}
*/
var lowestCommonAncestor = function(root, p, q) {
while (root) {
if (!root || root == p || root == q) return root
let left = lowestCommonAncestor(root.left, p, q)
let right = lowestCommonAncestor(root.right, p, q)
if (!left && !right) {
return false
}
if (!left) {
return right
}
if (!right) {
return left
}
return root;
}
};