Fundamentals of Data Structures in C

Features

• Cover Type: Paperback with 617 pages
• Published by: Silicon Pr
• Edition: 2nd Edition August 2007
• Written in: English
• ISBN 10 Number: 0929306406
• ISBN 13 Number: 978-0929306407
• Book Dimensions: 8.8 x 6 x 1.4 inches
• Weighs: 1.8 pounds

Reader Reviews
This review is from: Fundamentals of Data Structures in C++ (Hardcover) This book has an amazing amount of content. Very few data structures books contain quite as many structures as this one; In addition to containing all the common data structures one usually studies, people can also study Splay Trees, Compressed Tries, Patricia, Fibonacci Heaps...really the list keeps going. The only things that it seems to be missing are skip lists and multidimensional range trees... Most data structures have rigorous (college-level-worthy) proofs for complexity and performance. These proofs are typically required of a student in a graduate level course, and thus, this book could be used for a graduate-level text. Because of this however, some may find this book a little daunting, especially if you just need an introduction to the topic. The C++ code samples use templates so that the data structures can be generalized and used for any type. Therefore, the C++ code is very reusable. However, the code can sometimes be a bit hard to understand, mostly due to short variable names, and poor in-code comments. This is one of the reasons I didn't give this book 5 stars. Overall though, this book stands out in the crowd.