I finished binary search trees today. I didn't look at the theory or anything, just remembered the basic concept and then worked on the code to make it come right. Surprisingly, it did come right.

It wasn't that bad either.

And then, I got a Very ambitious idea. Until now, we've done stacks, queues (normal, double and circular), link-lists (again, sll, dll, cll), trees (binary, search, optimal search, and threaded) graphs and files as implementations. We've also done heaps, hash tables, trie indexing and b-trees. Wouldn't it be great if I could implement All of these?