🎙 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 2 of 10

A full binary tree has 20 internal vertices. How many leaves does it have?

A full binary tree has 20 internal vertices. How many leaves does it have?

  1. A.19
  2. B.21
  3. C.40
  4. D.41
Answer & explanation

Correct answer: 21

l = (m − 1)i + 1 = 1 × 20 + 1 = 21.

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 →