10:0210:02, 25 July 2010diffhist+52
AA tree
→Insertion: search in generic binary trees might just as well be iterative (you only need to search downward, and iteration is more efficient than recursion)
09:4409:44, 25 July 2010diffhist+7
Treap
→Comparison: This is a general computer science subject (not short-term practical computer engineering), and binary computers need not and therefore should not be assumed.
04:0404:04, 25 July 2010diffhist+31
Red–black tree
→Insertion: Parenthetically clarified why G must be black, in case 5. This wasn't obvious to me, having only about 15 minutes' familiarity with red-black trees.
01:2101:21, 25 July 2010diffhist+124
Binary search tree
→Deletion: Made caption of image visible and added to it an explanation of the symbolic meaning of the triangles, which was unclear. (I didn't figure it out on my first visit to the article).
09:0309:03, 24 July 2010diffhist+22
Kee Bird
Added detail to last sentence of intro paragraph. This isn't a cable TV documentary; no suspense needed. :)
12:2012:20, 23 July 2010diffhist+5
B-tree
→Notes: Renamed section. There's another Notes section with reference notes, and the name is more appropriate there than here.
03:3403:34, 23 July 2010diffhist+420
B-tree
→B-trees in filesystems: Rewrite in terms of file blocks and disk blocks. Application of logical/physical was incorrect. See talk page entry (coming soon). Also, correctionsi about FAT.