B-Trees

The number of rotations required to insert a sequence of elements 9,6,5,8,7,10 into an empty AVL tree is...

• 1

• 0

• 2

• 3

Balance factor of node 14 after deleting node 13 is ---

• 0

• -1

• 1

• -2

Which of the following is the most widely used external memory data structure?

• a) AVL tree

• b) B-tree

• c) Red-black tree

• d) Both AVL tree and Red-black tree

B-tree of order n is a order-n multiway tree in which each non-root node contains __________

• a) at most (n – 1)/2 keys

• b) exact (n – 1)/2 keys

• c) at least 2n keys

• d) at least (n – 1)/2 keys

 A B-tree of order 4 and of height 3 will have a maximum of _______ keys.

• 255

• 63

• 127

• 188

Figure shown below is B-tree of order 5. What is the result of deleting 130 from the tree?

• a

• b

• c

• d

Which of the following is true?

• a) larger the order of B-tree, less frequently the split occurs

• b) larger the order of B-tree, more frequently the split occurs

• c) smaller the order of B-tree, more frequently the split occurs

• d) smaller the order of B-tree, less frequently the split occurs

B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

• True

• False

B+ trees store data only in the leaf nodes. All other nodes (internal nodes) are called (a)  

B tree stores unsorted data.

• True

• False