题目链接
法一(后序遍历)
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 ? right : left;
}
本地测试
lay.showTitle(236);
Solution236 sol236 = new Solution236();
List<Integer> arr236 = Arrays.asList(3, 5, 1, 6, 2, 0, 8, null, null, 7, 4);
TreeNode root236 = treeOpt.createTreeByLayerOrder(arr236);
treeOpt.layerOrder(root236);
TreeNode p236 = treeOpt.findNodeByVal(root236, 5);
TreeNode q236 = treeOpt.findNodeByVal(root236, 4);
TreeNode ans236 = sol236.lowestCommonAncestor(root236, p236, q236);
treeOpt.showNode(ans236);