Please enable JavaScript.
Coggle requires JavaScript to display documents.
Data structure (Divide and conquer (Quick sort, Recursive merge sort,…
Data structure
Divide and conquer
Quick sort
Recursive merge sort
Binary search
Queue
FIFO
ADT
Queue CreateQ(max_size)
Boolean IsFull(queue, max_size)
Boolean Isempty(queue)
Queue ADDQ(queue, item)
Element DeleteQ(queue)
Genres
FIFO queue
priority queue
double-ended queue
double-ended priority queue
Binary tree
Traversal
Preorder(DLR)
Inorder(LDR)
Postorder(LRD)
Genres
Full binary tree
Complete binary tree
Perfect binary tree
Implementation
Creation
Deletion
Search
Insertion
Advanced tree
AVL tree
min-max Heap
M-way search tree
References
演算法筆記
http://www.csie.ntnu.edu.tw/~u91029/index.html
Data structure visualization
http://www.comp.nus.edu.sg/~stevenha/
http://www.learn-c.org/
Stack
Implementation
Array
Link list
LIFO
Recursive and iteration