Вы находитесь на странице: 1из 1

Creation

Deletion

Implementation

Search

Insertion

Preorder(DLR)

Traversal

Binary tree Inorder(LDR)


Binary search
Divide and conquer
Postorder(LRD)
Quick sort

Full binary tree


Recursive merge sort

Complete binary tree


Genres
min-max Heap
Advanced tree Perfect binary tree
Data structure
AVL tree
演算法筆記
M-way search tree http://www.csie.ntnu.edu.tw/~u91029/index.html

Recursive and iteration


References
Data structure visualization
http://www.comp.nus.edu.sg/~stevenha/
LIFO

http://www.learn-c.org/
Stack
Array
double-ended queue
Queue
Implementation FIFO queue
Link list
Genres
priority queue

double-ended priority queue


Queue CreateQ(max_size) FIFO

Boolean IsFull(queue, max_size)


ADT
Boolean Isempty(queue)

Queue ADDQ(queue, item)

Element DeleteQ(queue)

Вам также может понравиться