11. Syntax trees are comparatively denser than parse trees.
12. Electrical connectivity is an example of equivalence relation.
13. What is the Height of the root node of ternary tree?
14. The expression obtained by recursively producing a left expression, followed by an operator, followed by recursively producing a right expression is called?
15. How many prime concepts are available in nearest neighbour search in a kd tree?
16. In which year was Van Emde Boas tree invented?
17. 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?
18. Efficiency of bin depends upon . . . . . . . .
19. Is parent node of Node 3 and root node of the given ternary tree same?
20. Can leaf node be called child node in a K-ary tree?
Read More Section(Trees in Data Structures)
Each Section contains maximum 100 MCQs question on Trees in Data Structures. To get more questions visit other sections.