1. Computing

C++ Open Data Structures E-Book

By December 3, 2012

Follow me on:

No matter how many data structures I think I know there's always something new coming along. In Open Data Structures, the author Dr. Pat Morin covers many data structures, along with source code in C++ and Java.

The book covers these types: stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; and graphs, including adjacency matrix and ajacency list representations; and B-trees. Phew!

It's a nice website, and the author has even put the Latex sources on Github if you want to create your own custom version. Kudos...!

Comments
Comments are closed for this post.
Leave a Comment

Line and paragraph breaks are automatic. Some HTML allowed: <a href="" title="">, <b>, <i>, <strike>

©2014 About.com. All rights reserved.