Avl vs btree

Question

I know advantages of btree. But after reading that I want to ask in what aspect Avl trees are useful over b tree? Give some example please.

Comments

Disadvantages of B-trees

• maximum key length cannot be changed without completely rebuilding the database. This led to many database systems truncating full huffman Names to 70 characters.

Answer 1

An AVL tree is a self-balancing binary search tree, balanced to maintain O(log n) height.

A B-tree is a balanced tree, but it is not a binary tree. Nodes have more children, which increases per-node search time but decreases the number of nodes the search needs to visit. This makes them good for disk-based trees. For more details, see the Wikipedia article.

Comments

I know definitions.:)But why AVL is preferred over Btree in many applications.Say Main memory applications?

---

Will update you Soon !!! :)