Lowest Common Ancestor in a Binary Tree

To find the Lowest Common Ancestor (LCA) in a binary tree, use a recursive approach. Start at the root node and check if it’s null or matches one of the nodes (p or q). If it does, return the current node. Then, recursively check the left and right subtrees. If both subtrees return non-null nodes, the current node is the LCA. If only one subtree returns a node, that node is the LCA. This process ensures that the deepest node shared between p and q is identified as their LCA. This approach works efficiently with a time complexity of O(n).