原题链接:236. Lowest Common Ancestor of a Binary Tree
【思路】
和 Lowest Common Ancestor of a Binary Tree 不同的是。此二叉树的值可能有重复,并且节点上的大小顺序没有规律,那么就只能采用深度遍历。但是可以肯定的是p,q节点一定是分居最低在共同祖先的左右两侧(p或q本身为祖先除外):
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if (root == null) return null;
if (root == p || root == q) return root;
TreeNode leftSub = lowestCommonAncestor(root.left, p, q);
TreeNode rightSub = lowestCommonAncestor(root.right, p, q);
if (leftSub != null && rightSub != null) return root;
return leftSub != null ? leftSub : rightSub;
}
31 / 31 test cases passed. Runtime: 12 ms Your runtime beats 73.85% of javasubmissions.
欢迎优化!