← Quiz: Rooted Trees and Huffman Coding: all 10 questions
Quiz: Rooted Trees and Huffman Coding · Question 3 of 10
A full ternary tree has 10 internal vertices. How many vertices does it have in total?
A full ternary tree has 10 internal vertices. How many vertices does it have in total?
- A.21
- B.30
- C.31
- D.33
Answer & explanation
Correct answer: 31
n = mi + 1 = 3 × 10 + 1 = 31.
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 →