Types of Data Structures and Algorithms
Primitive Data Structures
Integer
Float
Character
Boolean
Pointer (in low-level languages)
Linear Data Structures
Array
Linked List (Singly, Doubly, Circular)
Stack
Queue (Simple, Circular, Priority Queue, Deque)
Non-Linear Data Structures
Trees: Binary Tree, BST, AVL, Red-Black, B-Trees, Segment Tree, Fenwick Tree, Trie, Suffix Tree,
Heap
Graphs: Directed/Undirected, Weighted/Unweighted, Adjacency List/Matrix
Hash-Based Structures
Hash Table / Hash Map
Hash Set
Bloom Filter (probabilistic)
Abstract Data Types (ADTs)
List
Stack
Queue
Deque
Set
Map (Dictionary)
Multimap
Multiset
Priority Queue
Specialized / Advanced Structures
Skip List
Suffix Array
Disjoint Set (Union-Find)
K-D Tree
Quad Tree / Octree
Trie Variants (Radix Tree, Patricia Trie)
Bloom Filter
Segment Tree
Persistent Segment Tree
Persistent / Functional Structures
Persistent Segment Tree
Immutable Linked List
Concurrent / Parallel Structures
Concurrent Queue
Lock-Free Stack
Concurrent Hash Map
Sorting Algorithms
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Counting Sort
Radix Sort
Bucket Sort
Shell Sort
Tim Sort
Comb Sort
Pigeonhole Sort
Cycle Sort
Bitonic Sort
Searching Algorithms
Linear Search
Binary Search
Jump Search
Interpolation Search
Exponential Search
Fibonacci Search
Ternary Search
Sublist Search
Hashing-based Search
Depth-First Search (DFS)
Breadth-First Search (BFS)
