1. Of the following rules that are followed by an AA-tree, which of the following is incorrect?
1. Only right children can be red
2. Procedures are coded recursively
3. Instead of storing colors, the level of a node is stored
4. There should not be any left children
1. Only right children can be red
2. Procedures are coded recursively
3. Instead of storing colors, the level of a node is stored
4. There should not be any left children
2. Which process forms the randomized binary search tree?
3. Who is the inventor of AA-Tree?
4. Which data structure is used to maintain a dynamic forest using a link or cut operation?
5. How many common operations are performed in a binary tree?
6. What are the disadvantages of normal binary tree traversals?
7. What is the reason behind the simplicity of a treap?
8. Is Top tree used for maintaining Dynamic set of trees called forest.
9. When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?
10. What is the parent for a node 'w' of a complete binary tree in an array representation when w is not 0?
Read More Section(Binary Search Trees(B Tree))
Each Section contains maximum 100 MCQs question on Binary Search Trees(B Tree). To get more questions visit other sections.