51. What is the worst-case running time of unions done by size and path compression?
52. Parse tree for the expression p & q % r % s & t & u is given below. Which of the following is correct for the given parse tree?

53. In a two-dimensional search tree, the root is arbitrarily chosen to be?
54. What is the time complexity for searching a key or integer in Van Emde Boas data structure?
55. What is the depth of Node G in the given ternary tree?

56. The 2d search tree has the simple property that branching on odd levels is done with respect to the first key.
57. Which among the following best represents the computational complexity of GLR parsing?
58. In a k-d tree, k originally meant?
59. The leaves of an expression tree always contain?
60. What is the worst case time complexity of query operation(n is the no. of candidates)?
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.