Leetcode Problem 236. Lowest Common Ancestor of a Binary Tree

236. Lowest Common Ancestor of a Binary Tree

Leetcode Solutions

Define a recursive function that takes the current node as an argument.
If the current node is None, return None.
If the current node is equal to p or q, return the current node.
Recursively call the function on the left and right children of the current node to search for p and q.
If both calls return non-null nodes, it means both p and q have been found in different subtrees, so return the current node as the LCA.
If only one of the calls returns a non-null node, return that node.
If both calls return None, return None.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen