https://estadosia.files.wordpress.com/2020/06/data-structures-succinctly-part-2.jpg

https://estadosia.files.wordpress.com/2020/02/recommended-information-3.jpg

Recommendation numbered, Nº: 22042020p1


🔘 Book page: bit.ly/2wb7Vox


Summary

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.

Chapters

  • Skip Lists
  • Hash Table
  • Heap and Priority Queue
  • AVL Tree

Author

[Unofficial biography. For informational purposes only]

Robert Horvick

Robert spent nearly 10 years at Microsoft creating software that made it easier for everyone else to write software. Most recently Robert worked on Team Foundation Server on the Administration and Version Control teams. Currently Robert can be found working in the utilities sector on Smart Grid technologies. (source: pluralsight.com/authors/robert-horvick)


Please, thank the author and Publisher


Thank you very much for this work to @Syncfusion, and @bubbafat via @States_AI_IA #data #ebook #free #openscience #openaccess #ai #artificialintelligence #ia #thebibleai