Introduction - Asymptotic Notation - Arrays - List Structures & Iterators - Stacks & Queues - Trees - Min & Max Heaps - Graphs - Hash Tables - Sets - Tradeoffs
As a start:
[TODO: cover binary search trees, tree traversals, iterators for trees, general trees, balanced binary trees, and red-black trees. Also ISAM and B+-trees]
Edit this chapter (http://en.wikibooks.org/w/index.php?title=Computer_Science:Data_Structures:Trees_content&action=edit)