Data Structures & Algorithms Multiple Choice Questions on “Ternary Tree – 2”.
1. How many extra nodes are there in Full ternary tree than a complete ternary tree?
a) 1
b) 2
c) 3
d) Both have same number of nodes
Answer: d
Clarification: Every Full ternary tree is also a complete ternary tree. Therefore, both have same number of nodes.
2. Can leaf node be called child node in a ternary tree?
a) True
b) False
Answer: a
Clarification: Leaf node is a node that has no child. Since Leaf node will always be the node on the last level of ternary tree, so it can be called child node of given parent node in ternary tree.
3. Can child node be always called Leaf node in the ternary tree?
a) True
b) False
Answer: b
Clarification: Leaf node is any node that does not contain any children. Child node may or may not contain more nodes. Child node will only be called leaf Node if the node has no child node.
4. Which of the following is the implementation of the ternary tree?
a) AVL Tree
b) Ternary Heap
c) Hash Table
d) Dictionary
Answer: b
Clarification: Ternary tree is used to implement ternary search tree and ternary heap. While AVL Tree, hash Table, dictionary are different types of Data Structures.