Solution: Lowest Common Ancestor of a Binary Tree III

Explore how to find the lowest common ancestor of two nodes in a binary tree by using a two-pointer technique that leverages parent pointers. This lesson helps you understand a method that traverses the tree upwards to identify the ancestor node in an efficient and space-conscious way, preparing you for similar interview challenges.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You are given two nodes, p and q. The task is to return their lowest common ancestor (LCA). Both nodes have a reference to their parent node. The tree’s root is not provided; you must use the parent pointers to find the nodes’ common ancestor.

Note: The lowest common ancestor of two nodes, p and q, is the lowest node in the binary tree, with both p and q as descendants.
In a tree, a descendant of a node is any node reachable by following edges downward from that node, including the node itself.

Constraints:

$-10^4 \leq$ ...