DSA book on 'This Week on C9'

Published Sat, Aug 30 2008 6:42

First off thank you to all who have downloaded the first draft of Data Structures and Algorithms: Annotated Reference with Examples. At the time of writing this post there have been more than 3200 downloads within around 3 days of it being put up on DotNetSlackers which is great!

Thanks to all those who have helped spread the word by linking to the posts I made and to the actual project page. I'd also like to thank Dan Fernandez who gave the book a mention on This Week on C9 (a weekly review program on the popular Channel9 site). You can view the episode here.

If you haven't checked it out already then go give the first draft of Data Structures and Algorithms: Annotated Reference with Examples a look.

by Granville Barnett
Filed under: , , ,

Comments

# Vadim said on Saturday, August 30, 2008 8:45 AM

It would be great if you reviewed so-called Cartesian Tree (Randomized Binary Search Tree, Treap). It allows to implement easily self-balanced tree without rotations but only through split/merge operations which are performed recursively in a simple manner.

Another good structure to include is Fenwick Tree (Bit indexed tree).

Thanks for the book!

# Granville Barnett said on Saturday, August 30, 2008 6:51 PM

Noted. Thanks for the suggestions Vadim.

Leave a Comment

(required) 
(required) 
(optional)
(required) 
If you can't read this number refresh your screen
Enter the numbers above: