LeetCode 865 | Smallest Subtree with all the Deepest Nodes | Recursive Explanation | Binary Tree
Автор: Code Kage
Загружено: 2026-01-08
Просмотров: 44
In this video, we solve LeetCode 865 – Smallest Subtree with All the Deepest Nodes using a simple and intuitive recursive approach.
We first understand what deepest nodes mean in a binary tree and then apply a clear idea:
If both left and right subtrees have the same depth, the current node is the answer.
Otherwise, we move toward the deeper subtree.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке: