dev:kb:data_structure_algorithm
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| dev:kb:data_structure_algorithm [2014/05/15 08:30] – hackerzhou | dev:kb:data_structure_algorithm [2020/06/06 23:32] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Data Structure & Algorithm ====== | ====== Data Structure & Algorithm ====== | ||
| - | ===== Basic ===== | ||
| - | ==== Stack ==== | ||
| - | ==== Queue ==== | ||
| - | ==== Heap ==== | ||
| + | ===== Array ===== | ||
| + | * Quick Sort | ||
| + | * Merge Sort | ||
| + | * Insertion Sort | ||
| + | * Bubble Sort | ||
| + | * Shell Sort | ||
| + | * Bucket Sort | ||
| + | * Radix Sort | ||
| + | * Heap Sort | ||
| + | ===== Stack ===== | ||
| + | |||
| + | ===== Queue ===== | ||
| + | === Priority Queue === | ||
| + | |||
| + | ===== Heap ===== | ||
| + | |||
| + | ===== Linked List ===== | ||
| + | ==== Singly Linked Lists ==== | ||
| + | ==== Doubly Linked Lists ==== | ||
| ===== Tree ===== | ===== Tree ===== | ||
| ==== B-Tree ==== | ==== B-Tree ==== | ||
| === B+ Tree === | === B+ Tree === | ||
| === B* Tree === | === B* Tree === | ||
| - | ==== Binary Tree ==== | + | ==== Binary |
| - | === Binary Search Tree === | + | === Balanced |
| - | == Balanced Binary Search | + | == AVL Tree == |
| - | = AVL Tree = | + | == Red-black Tree == |
| - | = Red-black Tree = | + | |
| ==== Trie ==== | ==== Trie ==== | ||
| + | ==== Radix Tree ==== | ||
| ===== Graph ===== | ===== Graph ===== | ||
| + | * Breadth First Search | ||
| + | * Depth First Search | ||
| + | |||
| + | ===== Hash ===== | ||
| + | ===== String Algorithm ===== | ||
| + | ===== Dynamic Programming ===== | ||
dev/kb/data_structure_algorithm.1400142634.txt.gz · Last modified: 2020/06/06 23:32 (external edit)