Published on

Minimum Depth of Binary Tree

Authors

📝 Vazifa tavsifi

Ikkilik daraxtning ildizidan (root) eng yaqin barg tugunga (leaf node) qadar bo'lgan minimal chuqurlikni toping.

Eslatma: Bu yerda daraxt massiv sifatida ifodalanadi (level-order traversal), bunda null bo'lmagan tugunlar ketma-ket keladi. Siz ushbu massiv yordamida chuqurlikni hisoblashingiz mumkin.

Siz minimal chuqurlikni hisoblashingiz kerak, bunda:

  • Ildiz tugunning chuqurligi 1 ga teng.
  • Har bir bolaning chuqurligi ota-onasiga nisbatan 1 ga katta.
  • Barg tugun — bu bolasi bo'lmagan tugun.

Misol:

Input: depth_count = 3 (daraxt: [3,9,20,null,null,15,7])
Output: 2
Tushuntirish: [3 -> 9] minimal chuqurlik 2 (3 dan 9 gacha).

Soddalashtirish: Biz bu yerda massiv berisak ham juda murakkab bo'ladi, shuning uchun biz n-size daraxt uchun minimal chuqurlikni matematik formula bilan hisoblaymiz.

Minimum Depth of Binary Tree

Oson15 daqiqa10 ball

📚 Misollar

Kiruvchi: leftChildren = [-1], rightChildren = [-1]
Chiquvchi: 1
// tree[i] = (left_child_index, right_child_index), -1 = null func solve(_ leftChildren: [Int], _ rightChildren: [Int]) -> Int { // Kodingizni shu yerga yozing // ildiz: indeks 0 return 0 }

Run tugmasini bosing

Buy mea coffee