282 views

1 Answer

Best answer
2 votes
2 votes
AVL Tree is balanced Binary Search Tree, in BST each node contains only one key so it will be a huge BST if we use it for indexing.
While in B/B++ tree a node contains many keys, the tree will have less height. Each node has the equal size to a Block size. In case of BST, I/O cost will be more because we have to fetch lots of data blocks.
selected

Related questions

0 votes
0 votes
1 answer
2
phaniphani asked Nov 16, 2023
176 views
is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?