Part I, Data Structures
字数 101 阅读 12 评论 6
Basic Data Structures
array
linked-list:doubly linked list, circular linked list
tree
N-ary Tree
Balanced Tree
Binary Tree
Binary Search Tree
AVL Tree
Red Black Tree
2–3 Tree
Minimum Spanning Tree (Prim and Kruskal algorithms)
- stack
- heap
- queue: priority queue
- hash table
- graph:Undirected/Directed Graph, Adjacency Matrix/List, Euler path
- string
Advanced Data Structrues
- Trie (also known as “Prefix Tree”)
- Segment Tree
- Fenwick Tree (also known as “Binary Indexed Tree”)
- Suffix Tree
- Suffix Array
Disjoint Data Structures
- disjoint set union