each node can have AT MOST 2 children: 3️⃣ MINIMUM & MAXIMUM NUMBER OF NODES IN A TREE OF HEIGHT h • Minimum nodes = h + 1 (skewed tree → har level pe ek hi node) • Maximum nodes = 2^(h+1) - 1 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results