Ikkilik daraxtning root ni hisobga olsak, har bir tugunning chuqurligiildizgacha bo'lgan eng qisqa masofadir.
eng kichik pastki daraxtni qaytaring, shunda u asl daraxtdagi barcha eng chuqur tugunlarni o'z ichiga oladi.
Tugun butun daraxtdagi har qanday tugun ichida mumkin bo'lgan eng katta chuqurlikka ega bo'lsa, ueng chuqurdeb ataladi.
Tugunningpastki daraxtibu tugundan va shu tugunning barcha avlodlari toʻplamidan iborat daraxtdir.
Eslatma: Bu savol 1123 bilan bir xil: https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/
1-misol:
Input: root = [3,5,1,6,2,0,8,null,null,7,4] Output: [2,7,4] Explanation: We return the node with value 2, colored in yellow in the diagram. The nodes coloured in blue are the deepest nodes of the tree. Notice that nodes 5, 3 and 2 contain the deepest nodes in the tree but node 2 is the smallest subtree among them, so we return it.
2-misol:
Input: root = [1] Output: [1] Explanation: The root is the deepest node in the tree.
3-misol:
Input: root = [0,1,3,null,2] Output: [2] Explanation: The deepest node in the tree is 2, the valid subtrees are the subtrees of nodes 2, 1 and 0 but the subtree of node 2 is the smallest.
Cheklovlar:
- Daraxtdagi tugunlar soni
[1, 500]oralig'ida bo'ladi. 0 <= Node.val <= 500- Daraxtdagi tugunlarning qiymatlarinoyobdir.
Batafsil tushuntirish bilan yechim uchun quyidagi havolaga tashrif buyuring
