دانلود کتاب Grokking Data Structures (نسخه PDF + به همراه سورس کد تمرین ها)

Data Structure 

Chapter 

Applications

Array 

2, 3, 5 

• Arrays have countless applications. Use them whenever you need to store a collection of items and efficiently retrieve them by their position.

• Arrays are also a building block used to implement more advanced data structures such as stacks, queues, graphs, hash tables, and so on.

Bag 

7 

• Keep a set of items and iterate through it regardless of the order.

Binary search

tree

11 

• Balanced binary search trees are mainly used to store sorted datasets and provide worst-case logarithmic-time operations to insert, delete, and search elements and to find the predecessor and successor of any element.

Dictionary 

12 

• As associative arrays, they solve the problem of storing and retrieving items by key instead of by position (like regular arrays).

Graph 

13 

• Modeling arbitrarily complex relationships, such as social networks, transportation networks, computer networks, circuit design, game design, biological systems, and so on.

• Recommendation systems, web crawlers, search engines.

• Graph databases.

• Graph neural networks.

Hash table 

12 

• Counting elements, removing duplicates, routers, CDNs, firewalls, browsers.

• Symbol tables in compilers, garbage collectors, DB indexing, and so on.

Heap 

10 

• Heapsort sorting algorithm. See also Priority queue.