B-tree vs. Binary Search Tree � Attractive ChaosB-tree vs. Binary Search Tree September 24, 2008 by attractivechaos 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. Is B-tree also a good data structure for in-memory ordered dicti
