• Title Data Structures Succinctly, Part 2
• Author(s) Robert Horvick
• Publisher: Syncfusion Inc. (2013)
• Paperback N/A
• ebook PDF (129 pages, 1.89 MB), Kindle (mobi), etc.
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book Description

Data Structures Succinctly Part 2 is your concise guide to skip lists, hash tables, heaps, priority queues, AVL trees, and B-trees. As with the first book, you'll learn how the structures behave, how to interact with them, and their performance limitations. Starting with skip lists and hash tables, and then moving to complex AVL trees and B-trees, author Robert Horvick explains what each structure's methods and classes are, the algorithms behind them, and what is necessary to keep them valid. The book also features downloadable code samples and vivid diagrams to help you visualize the more abstract concepts, like node height and node rotations.

• N/A

• Amazon

• Algorithms and Data Structures
• Operations Research (OR), Linear Programming, Optimization, and Approximation
• Computational and Algorithmic Mathematics
• Computational Complexity
• Discrete Mathematics

• Data Structures Succinctly, Part 2 (Robert Horvick)

• Data Structures Succinctly, Part 1 (Robert Horvick)
• Think Data Structures: Algorithms and Information Retrieval
• Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne
• The Algorithm Design Manual (Steven S. Skiena)
• Data Structures and Algorithms: Annotated Reference with Examples