Algorithm + Rust + JS, following CLRS

Data Structure

Binary Tree

1. Traverse ( DFS + BFS )
2. Balance
3. extension: binary search tree, avl tree, RB tree.

Union-Find

Hash Table

Method

Greedy

Dynamic Programming

Divide-and-Conquer Method

3 steps:

1. the meaning of each element
2. the relationship between elements
3. initial situation

Design

LRU cache

Graph

1. Adjacency List
2. Adjacency Matrix
3. Minimum Spanning Tree
4. shortest paths: Floyd–Warshall algorithm

Graphics

DDA