Description

Given a binary tree root and two integers num1 and num2, create a function that returns the lowest common ancestor of num1 and num2. The lowest common ancestor is the deepest node in root that has both num1 and num2 as descendants, and we consider a node as a descendant of itself.
Note that all values are unique and that num1 and num2 always exist in the tree.

Example 1:

• Input: root = [4, 10, 6, 5, null, 7, 13, 2, 18, 1, null, 8, 16, 14, 9, null, null, null, null, null, null, null, null, null, null, 22, 3], num1 = 7, num2 = 16
• Output: 6
• Explanation:

Try some input:

Try to solve:

Select a language:

Python
Java
C++
Javascript

Solution:

Code:

Select a language:

Python
Java
C++
JavaScript

Frequently asked questions:

No questions yet.
You can ask a question in comment section below.