← Quiz: Rooted Trees and Huffman Coding: all 10 questions
Quiz: Rooted Trees and Huffman Coding · Question 5 of 10
What is the minimum height of a binary tree with 100 leaves?
What is the minimum height of a binary tree with 100 leaves?
- A.5
- B.6
- C.7
- D.50
Answer & explanation
Correct answer: 7
A binary tree of height h has at most 2ʰ leaves; 2⁶ = 64 < 100 ≤ 128 = 2⁷.
Can you get the rest right without peeking?
Take the timed Quiz: Rooted Trees and Huffman Coding quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →