Karamagi Robert. Data Structures and Algorithms in Python

Independently published, 2020. — 404 p. — ISBN B08LBY7Q16.A Data Structure is a way of collecting and organising data in such a way that we can perform operations on these data in an effective way. An Algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Algorithms are generally created independent of underlying programming languages. This book is based on Python and is structured to give an insight into the various data structures and algorithms.Algorithm
What is an Algorithm?
Why Learn Data Structures and Algorithms?
Asymptotic Analysis
Master Theorem
Divide and Conquer Algorithm
Data Structures
Stack
Queue
Types of Queue
Circular Queue
Priority Queue
Deque
LinkedList
Linked List Operations
Types of Linked List
Hash Table
Heap
Fibonacci Heap
Trees
Tree Traversal
Binary Tree
AVL Tree
B-tree
B+ Tree
Red-Black Tree
Graph
Spanning Tree
Adjacency Matrix
Adjacency List
Depth First Search
Breadth First Search
Bellman Ford's Algorithm
Sorting
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quicksort
Counting Sort
Radix Sort
Bucket Sort
Heap Sort
Shell Sort
Search
Linear Search
Binary Search
Greedy Algorithm
Ford-Fulkerson Algorithm
Dijkstra's Algorithm
Kruskal's Algorithm
Prim's Algorithm
Huffman Coding
Dynamic Programming
Floyd-Warshall Algorithm
Longest Common Subsequence
Backtracking Algorithm
Rabin-Karp Algorithm