If T is a binary tree with number of levels as L (counting the root as level…
Coal India · Computer Science · 2017
If T is a binary tree with number of levels as L (counting the root as level 1), then the number of leaf nodes in the binary tree is at most:
- A.
2ᴸ⁺¹
- B.
2L
- C.
2ᴸ
- D.
2ᴸ⁻¹
Attempted by 997 students.
Show answer
Correct answer: D
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…