Leetcode Problem 1644. Lowest Common Ancestor of a Binary Tree II

1644. Lowest Common Ancestor of a Binary Tree II

Leetcode Solutions

Initialize a boolean flag nodesFound as False.
Define a recursive DFS function that takes a node as input.
If the current node is null, return null.
Recursively call DFS on the left and right children of the current node.
Check if the current node is p or q.
If p or q is found in the left or right subtree, set nodesFound to True.
If two of the three conditions are met, return the current node as the LCA.
After DFS, if nodesFound is True, return the LCA; otherwise, return null.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen