Home

This is the Wiki for the open data structures project. This is the place to provide feedback to the author on the book.

Topic Requests

If you have a request for a specific topic that you would like to see included in an upcoming version of the book, you can request it here. Be sure to add your name so that the author has some idea of how popular this request is.

List of requested topics

• AVL trees - requested by Pat Morin, Zaojun Lu
• Graham's scan as an application of stacks and deques - requested by Pat Morin
• Plane sweep as an application of priority queues and dictionaries - requested by Pat Morin
• Merge sort, quicksort, and heapsort, because of their relationship with Treaps and Heaps - requested by Pat Morin
• Graph representations (adjacency matrix and adjacency list) - requested by Pat Morin

Clarification Requests

If you feel that some section of the book is not precise enough, or leaves too much to the reader, add a clarification request here. Please be as specific as possible:

• Amortized analysis of 2-4 trees - requested by Pat Morin

Errata

If you would like to point out, and possibly correct, an error in the book, you can do so here. You should also consider reporting an issue.

• Author's name is misspelled in the title page (example)