LeetCode – Lowest Common Ancestor of a Binary Tree (Java)
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. Java Solution 1 public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { if(root==null) return null; if(root==p || root==q) return root; TreeNode l = lowestCommonAncestor(root.left, p, q); TreeNode r = lowestCommonAncestor(root.right, p, q); if(l!=null&&r!=null){ return root; … Read more