Your account has not been activated. Click here to send an activation email to your email address.
Unfortunately, activation email could not send to your email. Please try again.

Data Structures Succinctly Part 2


Robert Horvick

datastructurespart2_succinctly
Free EBook
  • OVERVIEW

    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.

  • TABLE OF CONTENTS
    • Skip Lists

    • Hash Table

    • Heap and Priority Queue

    • AVL Tree

Author

Robert Horvick

Published on

Jul 7, 2014

Pages

126

Categories
Tags

Search more than 130 E-books

Looking for something specific? Try our title or author search.

Explore all e-books
Thank you for downloading Data Structures Succinctly Part 2.
×

You are using an outdated version of Internet Explorer that may not display all features of this and other websites. Upgrade to Internet Explorer 8 or newer for a better experience.