In this post we will solve LeetCode 235. Lowest Common Ancestor of a Binary Tree problem using Java.
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).” Constraints: o The number of nodes in the tree is in the range [2, 10^5]. o -10^9 <= Node.val <= 10^9 o All Node.val are unique. o p != q o p and q will exist in the BST. Realated Topics: o Tree o Depth-First Search o Binary Search Tree o Binary Trea
We are given a Binary Search Tree (BST) and the pointers / references to two nodes in the tree. We need to return the Lowest Common Ancestor (LCA) node. Continue reading “LeetCode 235. Lowest Common Ancestor of a Binary Tree in Java”