Q.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
Q.2.
Is Node A sibling of Node D in the given ternary tree?
- a) True
- b) False
Q.3.
What is the size of the given ternary tree?
- a) 3
- b) 2
- c) 6
- d) 4
Q.4.
Who is the ancestor of Node G?
- a) C
- b) F
- c) H
- d) A
Q.5.
Who is descendant of Node B?
- a) A
- b) E
- c) F
- d) Both E and F
Q.6.
What is the size of Node A?
- a) 1
- b) 2
- c) 3
- d) 4
Q.7.
Can leaf node be called child node in a ternary tree?
- a) True
- b) False
Q.8.
Can child node be always called Leaf node in the ternary tree?
- a) True
- b) False
Q.9.
Which of the following is the implementation of the ternary tree?
- a) AVL Tree
- b) Ternary Heap
- c) Hash Table
- d) Dictionary