51. How many extra nodes are there in Full K-ary tree than complete K-ary tree?
52. What is the depth of the root node of the ternary tree?
53. What is the Height of the given ternary tree?
54. Who is descendant of Node B?
55. Which node is the Leaf node in the following K-ary tree?
56. Which node is the root node of the following ternary tree?
57. What will be the time complexity of delete operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects)
58. How many properties will an equivalent relationship satisfy?
59. What is the size of Node B in given K-ary tree?
60. Which data structure is used in the syntax analysis phase of the compiler?
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.