81. Assume +, -, *, / are usual arithmetic operator, + has highest precedence and right associative and -, *, / have equal precedence and left associative. What is the output of the expression 23 * 3 - 6 + 11 - 2 * 8 / 4?
82. Which node is the parent node of Node 6?
83. What is the other name or Van Emde Boas Tree data structure?
84. On which abstract data type does van Emde Boas tree performs the operation?
85. Is Node A sibling of Node B in the given K-ary tree?
86. Each level in a k-d tree is made of?
87. Suppose X is the starting symbol of the given grammar with the following transition rules. Compute the value of X as the root of the parse tree for the expression: 3 & 4 % 7.
X → X1 & B | B {X.value = X1.value + B.value, X.value = B.value}
B → B1 % D | D {B.value = B1.value * D.value, B.value = D.value}
D → num {D.value = num.value}
X → X1 & B | B {X.value = X1.value + B.value, X.value = B.value}
B → B1 % D | D {B.value = B1.value * D.value, B.value = D.value}
D → num {D.value = num.value}
88. Only infix expression can be made into an expression tree.
89. Which nodes are the siblings of Node D of given ternary tree?
90. What is the time complexity for finding a maximum and minimum integer in Van Emde Boas data structure?
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.