对于一般二叉树:
我的思路:
递归,然后每次先进行左右子节点的递归,用一个found字段来标志是否找到了祖先结点,判断当前结点的左右子树结点是否含有所求的p、q结点,有就将当前root结点存储,并将found设为true后续不在进行ancestor结点的更新,或者当前root结点为所求结点的p或q的其中一个,并且当前root结点还含有所求的另一个p或q结点,这时也可以将found设为true。
正常情况下返回当前结点是否为p或q结点,或包含所求结点的bool值
class Solution {
boolean found = false;
TreeNode ancestor = null;
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
search(root, p, q);
return ancestor;
}
public boolean search(TreeNode root, TreeNode p, TreeNode q) {
if (root == null) {
return false;
}
boolean left = search(root.left, p, q);
boolean right = search(root.right, p, q);
if (!found && (left && right)) {
found = true;
ancestor = root;
}
if (!found && (root.val == p.val || root.val == q.val) && (left|| right)) {
found = true;
ancestor = root;
}
return root.val == p.val || root.val == q.val || left || right;
}
}
力扣题解思路:(相当巧妙)
如果左右都为空就返回null,如果有一个不为空,就返回当前左右不为空的返回值,如果都不为空,就返回当前root
最近公共祖先的可能情况:
递归的分析:
具体代码:
class Solution {
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) return right;
if(right == null) return left;
return root;
}
}
二叉搜索树的最近公共祖先:(利用BST的有序特性)
递归法:
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if (root.val > p.val && root.val > q.val) return lowestCommonAncestor(root.left, p, q);
if (root.val < p.val && root.val < q.val) return lowestCommonAncestor(root.right, p, q);
return root;
}
}
迭代法:
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
while (true) {
if (root.val > p.val && root.val > q.val) {
root = root.left;
} else if (root.val < p.val && root.val < q.val) {
root = root.right;
} else {
break;
}
}
return root;
}
}