Lowest Common Ancestor of a binary tree || Intuition + example + explanation + code
Автор: Code with Alisha
Загружено: 2021-09-17
Просмотров: 3670
Описание:
Given a Binary Tree with all unique values and two nodes value n1 and n2. The task is to find the lowest common ancestor of the given two nodes. We may assume that either both n1 and n2 are present in the tree or none of them is present.
Example 1:
Input:
n1 = 2 , n2 = 3
1
/ \
2 3
Output: 1
Explanation:
LCA of 2 and 3 is 1.
Example 2:
Input:
n1 = 3 , n2 = 4
5
/
2
/ \
3 4
Output: 2
Explanation:
LCA of 3 and 4 is 2.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: