![]() ![]() ![]() They are different in that an AVL tree is implemented with memory-based solutions in mind, while a B-tree is implemented with disk-based solutions in mind. It's a little too complicated to write out, but if you Google search "B-tree animation" there are some really good applets out there that explain a B-tree pretty well. Basically, it will not allow long branches.Ī B-tree also does this, but through a different re-balancing scheme. However, it is self-balancing, which means that as you add elements to the tree, it will restructure itself to maintain as uniform of a height as it can. This is an AVL tree, and is a binary search tree at its core. This "shortness" allows searching to be performed in O(log n) time, because the largest possible number of reads corresponds to the height of the tree. Both the AVL tree and the B-tree are similar in that they are data structures that, through their requirements, cause the height of their respective trees to be minimized. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |