2,329 views
0 votes
0 votes
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.

1 Answer

0 votes
0 votes

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.

Related questions

6 votes
6 votes
3 answers
1
0 votes
0 votes
0 answers
2
GO Classes asked Feb 4
112 views
DBMS question: One SQL query is given. Based on the query which data structure can be used involving hashing, B+ tree, etc?