🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← 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?

  1. A.5
  2. B.6
  3. C.7
  4. 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 →