This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses 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
View Answer
Explanation: Every Full ternary tree is also a complete ternary tree. Therefore, both have same number of nodes.
2. Is Node A sibling of Node D in the given ternary tree?
a) True
b) False
View Answer
Explanation: Node B, Node C are the siblings of Node D while Node A is the parent node of Node D.
3. What is the size of the given ternary tree?
a) 3
b) 2
c) 6
d) 4
View Answer
Explanation: Size of the ternary tree is defined as the total number of nodes present in the tree. Since there are total of 6 nodes in the ternary tree. So the size of the ternary tree is 6.
4. Who is the ancestor of Node G?
a) C
b) F
c) H
d) A
View Answer
Explanation: Ancestor node is a node that comes in between the path from the node to the root. Since Node C comes between node G and root, so Node C is called the ancestor node.
5. Who is descendant of Node B?
a) A
b) E
c) F
d) Both E and F
View Answer
Explanation: Descendant node is a node which has a direct path from ancestor node. Since both E and F are connected to B, so Node E and Node F are the descendants of Node B.
6. What is the size of Node A?
a) 1
b) 2
c) 3
d) 4
View Answer
Explanation: Size of node is defined as the total number of descendants of that node including itself. So, size of Node A is 4.
7. Can leaf node be called child node in a ternary tree?
a) True
b) False
View Answer
Explanation: 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.
8. Can child node be always called Leaf node in the ternary tree?
a) True
b) False
View Answer
Explanation: 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.
9. Which of the following is the implementation of the ternary tree?
a) AVL Tree
b) Ternary Heap
c) Hash Table
d) Dictionary
View Answer
Explanation: Ternary tree is used to implement ternary search tree and ternary heap. While AVL Tree, hash Table, dictionary are different types of Data Structures.
Sanfoundry Global Education & Learning Series – Data Structure.
To practice all areas of Data Structure, here is complete set of 1000+ Multiple Choice Questions and Answers.
If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]
- Practice Programming MCQs
- Check Programming Books
- Apply for Computer Science Internship
- Practice Design & Analysis of Algorithms MCQ
- Check Computer Science Books
