Leetcode Problem 1123. Lowest Common Ancestor of Deepest Leaves

1123. Lowest Common Ancestor of Deepest Leaves

Leetcode Solutions

Define a recursive function helper that takes a TreeNode as an argument and returns a pair of TreeNode and integer.
If the current node is null, return a pair of null and 0.
Recursively call helper for the left and right children of the current node.
Compare the depths returned by the left and right subtree.
If the depths are equal, the current node is the LCA of the deepest leaves.
If the depths are different, return the node and depth from the subtree with the greater depth.
The main function lcaDeepestLeaves calls helper on the root and returns the TreeNode part of the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen