B and B+ Trees

All the data in this type of tree is at the leaf nodes

• B Tree

• B+ Tree

• Both

• none

There will be duplicate(redundant) keys in this type of tree

• B+ tree

• B tree

• AVL tree

• none

Properties of B+ Tree which are not in B tree

• Internal nodes store only keys/indexes

• leaf only contain data

• leaf nodes are linked similar to linked list

• All the mentioned

Data is stored in leaf nodes as well as internal nodes.

• B Tree

• B+ Tree

• Both

• None

Searching is faster in which tree

• B Tree

• B+ Tree

• both

• none

No redundant search keys are present.

• B+ Tree

• B Tree

• both

• none

Leaf nodes are linked together to form a linked list.

• B + tree

• B tree

• AVL tree

• m-way tree

Applications of B tree and B+ tree

• Database indexing

• Multilevel indexing

• Faster search operations

• All the above

The tree in the image is__________

• BST

• AVL Tree

• B Tree

• B+ Tree

The tree in the image is_____________

• BST

• AVL

• B Tree

• B+ Tree