http://people.ksp.sk/~kuko/bak/
B-tree vs. Binary Search Tree
When talking about in-memory search tree, we usually think of various binary search trees: red-black tree, AVL tree, treap, splay tree and so on. We do not often think of B-tree, as B-tree is commonly introduced as an on-disk data structure rather than in-memory one.
http://attractivechaos.wordpress.com/2008/09/24/b-tree-vs-binary-search-tree/
No comments:
Post a Comment