1. What is computational geometry?
2. Assume +, -, * are usual arithmetic operators. * has the lowest precedence, + has the highest precedence and the precedence of - is medium. + and * are left-associative whereas - is right-associative. What is the value of the expression 3 - 8 + 2 - 9 * 3?
3. Can child node be always called Leaf node in the K-ary tree?
4. Can operation like Find Next and Find Previous be implemented.
5. What is the depth of any tree if the union operation is performed by height?
6. What is the time complexity for deleting a key or integer in Van Emde Boas data structure?
7. Does Van Emde Boas data structure perform all operation in O (log (log M)) time where M = 2m.
8. In the Union/Find algorithm, the ranks of the nodes on a path will increase monotonically from?
9. What is the size of Node A?
10. Bin is an example of a range query 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.