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.
Data Structures Succinctly Part 1 is your first step to a better understanding of the different types of data structures, how they behave, and how to interact with them. Starting with simple linked lists and arrays, and then moving to more complex structures like binary search trees and sets, author Robert Horvick explains what each structure’s methods and classes are and the algorithms behind them. Horvick goes a step further to detail their operational and resource complexity, ensuring that you have a clear understanding of what using a specific data structure entails.
This is an interactive book which aims to be the best place on the internet for learning SQL. It is free of charge, free of ads and doesn’t require registration or downloads. It helps you learn by running queries against a real-world dataset to complete projects of consequence. It is not a mere reference page — it conveys a mental model for writing SQL.