http://msmvps.com/blogs/gbarnett/archive/2008/08/30/dsa-book-on-this-week-on-c9.aspxFirst 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 onenCommunityServer 2008.5 SP2 (Build: 40407.4157)http://msmvps.com/blogs/gbarnett/archive/2008/08/30/dsa-book-on-this-week-on-c9.aspx#1646301Sat, 30 Aug 2008 23:51:40 GMTd67277c4-116b-43f1-b688-e9ef184ea916:1646301Granville Barnett<p>Noted. Thanks for the suggestions Vadim.</p> <div style="clear:both;"></div><img src="http://msmvps.com/aggbug.aspx?PostID=1646301" width="1" height="1">http://msmvps.com/blogs/gbarnett/archive/2008/08/30/dsa-book-on-this-week-on-c9.aspx#1646274Sat, 30 Aug 2008 13:45:45 GMTd67277c4-116b-43f1-b688-e9ef184ea916:1646274Vadim<p>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.</p> <p>Another good structure to include is Fenwick Tree (Bit indexed tree).</p> <p>Thanks for the book!</p> <div style="clear:both;"></div><img src="http://msmvps.com/aggbug.aspx?PostID=1646274" width="1" height="1">