Array, Sparse Table, Single Linked List, Double Linked List, Block Linked List, Skip List, Queue and Circular Queue, Deque, Monotonic Queue, Stack, Monotonic Stack, Double-ended Stack, Hash Table, Heap, Trie Tree, ArrayMap, SparseArray, Binary Tree, Binary Search Tree (BST), Cartesian Tree, AVL Tree, Treap, FHQ-Treap, Huffman Tree, Rolling Array, Difference Array, LRU Cache, LFU Cache
……
“Classic Graph Algorithms” Column
Introduction to Graphs, Graph Representation, Adjacency Matrix Conversion, Breadth-First Search (BFS), Depth-First Search (DFS), A* Search Algorithm, Iterative Deepening Depth-First Search (IDDFS), IDA* Algorithm, Bidirectional Breadth-First Search, Dijkstra’s Algorithm, Bellman-Ford Algorithm, SPFA Algorithm, Floyd’s Algorithm, Kahn’s Algorithm, DFS-based Topological Sorting, Johnson’s Algorithm
……