Q1. What is the Height of the root node of ternary tree?.
A. 1.
B. 2.
C. 3.
D. 0.
Answer= 0
Q2. 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= Both have same number of nodes
Q3. Can leaf node be called child node in a ternary tree?.
A. TRUE.
B. FALSE.
C. Nothing Can be said.
D. None of the mentioned.
Answer= TRUE
Q4. Can child node be always called Leaf node in the ternary tree?.
A. TRUE.
B. FALSE.
C. Nothing Can be said.
D. None of the mentioned.
Answer= FALSE
Q5. Which of the following is the implementation of the ternary tree?.
A. AVL Tree.
B. Ternary Heap.
C. Hash Table.
D. Dictionary.
Answer= Ternary Heap
Q6. How many child nodes does each node of K-ary Tree contain?.
A. 2.
B. 3.
C. more than k.
D. at most k.
Answer= at most k
Q7. Which of the following is the name of the node having child nodes?.
A. Brother.
B. Sister.
C. Mother.
D. Parent.
Answer= Parent
Q8. What is the depth of the root node of K-ary tree?.
A. 2.
B. 1.
C. 0.
D. 3.
Answer= 0
Q9. What is the Height of the root node of K-ary tree?.
A. 1.
B. 2.
C. 3.
D. 0.
Answer= 0
Q10. Can leaf node be called child node in a K-ary tree?.
A. TRUE.
B. FALSE.
C. Nothing can be said.
D. None of the mentioned.
Answer= TRUE
Q11. Can child node be always called Leaf node in the K-ary tree?.
A. TRUE.
B. FALSE.
C. Nothing can be said.
D. None of the mentioned.
Answer= FALSE
Q12. What is the upper bound for maximum leaves in K-ary tree with height h?.
A. K*h.
B. K^h.
C. K+h.
D. K-h.
Answer= K^h
Q13. What is the height of a K-ary tree having only root node?.
A. 1.
B. 0.
C. 2.
D. 3.
Answer= 0
Q14. Which one of the following is the correct formulae to find the parent node at index I?.
A. (I-1)/K.
B. (I+1)/K.
C. (I*1)/K.
D. (I-2)/K.
Answer= (I-1)/K
Q15. How many extra nodes are there in Full K-ary tree than complete K-ary tree?.
A. 1.
B. 2.
C. 3.
D. Both have same number of nodes.
Answer= Both have same number of nodes
Q16. What is the other name or Van Emde Boas Tree data structure?.
A. Van Emde Boas Array.
B. Van Emde Boas Stack.
C. Van Emde Boas Priority Queue
D. Van Emde Boas Heap.
Answer= Van Emde Boas Priority Queue
Q17. Who Invented The vEB also known as Van Emde Boas Tree?.
A. Peter Van Emde Boas.
B. Samuel F. B. Morse.
C. Friedrich Clemens Gerke.
D. Alexander Morse.
Answer= Alexander Morse
Q18. What is the time complexity for storing the maximum number of elements in Van Emde Boas tree if M is the maximum number of elements?.
A. O (log M).
B. O (M!).
C. O (M).
D. O (1).
Answer= O (M)