← 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?
- A.19
- B.21
- C.40
- 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 →