Tree structure concept (1) Hash table storage (1) Hash Conflict Resolution (1) Linear detection (1) sequential search (1) Recursive Explanation (1) Python recursion (1) Divide and conquer (1) Algorithm Principles (1) Change-making problem (1) Algorithm Design (1) local optimum (1) greedy-choice property (1) min heap (1) Heap algorithm (1) Basic concepts of graphs (1) adjacency list (1) Adjacency table implementation (1) AVL tree (1) Rotation operation (1) Balance factor (1) Introduction to Dynamic Programming (1) Efficient solution (1) Memorized recursion (1) Recursive method (1) Prefixes and arrays (1) Interval and Calculation (1) Prefixes and applications (1) Merge by rank (1) Figure Data Structure (1) Advantages and disadvantages of adjacency matrix (1) Diagram representation method (1) Comparison of adjacency tables (1) Hash value generation (1) Characteristics of Hash Functions (1) Difference between Hash and Encryption (1) Hash application scenarios (1) DFS of Trees (1) Preorder traversal (1) Stack implementation (1) Root to leaf path (1) The BFS of Trees (1) Breadth first search (1) level-order traversal (1) Queue implementation BFS (1) Open addressing (1) Single chain list reversal (1) Iterative inversion method (1) Recursive inversion (1) Linked list inversion algorithm (1)