21. What is the depth of Node F in the given K-ary tree?
22. Who invented k-d trees?
23. Who is the ancestor of Node H?
24. What is the upper bound for maximum leaves in K-ary tree with height h?
25. What is the size of the given K-ary tree?
26. Can child node be always called Leaf node in the ternary tree?
27. Which nodes are the siblings of Node B of given ternary tree?
28. Insertion into a 2-d tree is a trivial extension of insertion into a binary search tree.
29. Is Node A sibling of Node D in the given ternary tree?
30. Which of the following expression can be represented by the given syntax 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.