11. What is the maximum number of children a node in a B-Tree of order m can have?
12. Which operation in a B-Tree involves redistributing keys between nodes to maintain balance?
13. In an AVL tree, what type of rotation is performed when a node has a balance factor of +2 and its right child has a balance factor of -1?
14. In a Red-Black tree, what does the black-height of a node represent?
15. What is the time complexity of searching for an element in a B-Tree of order m?
16. Which type of rotation is performed to fix a right-right case imbalance in an AVL tree?
17. In a Red-Black tree, which property is used to ensure that the path from the root to the farthest leaf is no more than twice as long as the path to the nearest leaf?
18. What is the maximum number of children a non-root node can have in a B-Tree of order m?
19. In an AVL tree, what happens when a node's balance factor becomes +2 due to an insertion in the right subtree of the right child?
20. How are keys stored in a B-Tree node?
Read More Section(Advanced Trees (AVL, RedBlack, BTrees))
Each Section contains maximum 100 MCQs question on Advanced Trees (AVL, RedBlack, BTrees). To get more questions visit other sections.