Are you studying data science and want to take your learning further ? Data structures are an integral part of data science, machine learning, and algorithms, all aimed at solving programming challenges that might seem insurmountable at the outset.
Advanced Data Structures for Algorithms builds on your current knowledge, taking your learning much deeper and teaching you how to solve even the trickiest of challenges.
This book has been divided into four parts:
Part One covers advanced lists, including:
โข An overview of linked lists
โข Doubly linked lists
โข XOR linked lists
โข Self-organizing lists
โข Unrolled linked lists
Part Two covers trees, including:
โข Segment trees
โข Trie trees
โข Fenwick trees
โข AVL trees
โข Red-black trees
โข Scapegoat trees
โข Treap
โข N-ary
Part Three discusses disjoint sets or Union-finds, as they are sometimes known
Part Four covers heaps and priority queues, including:
โข A brief discussion on binary heaps
โข Binomial heaps
โข Fibonacci heaps
โข Leftist heaps
โข K-ary heaps
โข Iterative heapsorts
Youโll find plenty of code examples to help you make sense of things and common-sense explanations.
If you want to advance your knowledge of data structures for algorithms you are in the right place.