Proof of my Verbosity
In case you needed proof of my verbosity, how about my latest installment on my Extensive Examination of Data Structures series: Part 3 is 31 printed pages. Yipes!
For those who are interested, Part 3 looks at trees, focusing on binary trees and binary search trees (BSTs). Over the course of the article both BinaryTree and BST classes are built (in C#), with a (very) thorough discussion on the operations one might want to perform on trees and their respective asymptotic running times. Lots of figures and code listings...
Enjoy!