wuling31715/2018-NCCU-Data-Structure

Algorithm

Array

• Array

Stack

• Stack
• Postfix

Queue

• Queue
• Circular Queue
• Circular Queue (Tag)
• Double Queue

Linked List

• Single Linked List
• Circular Single Linked List
• Circular Doubly Linked List
• Stack in Linked List
• Queue in Linked List

Recursion

• Factorial
• Fibonacci
• Greatest Common Divisor (GCD)
• Hanoi Tower

Tree

• Binary Tree
• Binary Search Tree (BST)
• AVL Tree
• 2-3 Tree
• 2-3-4 Tree
• M-Way Tree
• B Tree
• Red-Black Tree

Heap

• Min Heap
• Max Heap
• Min Max Heap
• Deap

Graph

• Depth Fisrt Search (DFS)
• Breadth First Search (BFS)
• Kruskal’s Minimum Spanning Tree (MST)
• Prim’s Minimum Spanning Tree (MST)
• Sollin’s Minimum Spanning Tree (MST)
• Dijkstra’s Shortest Path
• Floyd's Shortest Path
• Warshall's Shortest Path
• Topological Sort

Sort

• Insertion Sort
• Selection Sort
• Bubble Sort
• Quick Sort
• Merge Sort
• Heap Sort
• Radix sort
• Bucket Sort
• Counting Sort

Search

• Linear Search
• Binary Search
• Fibonacci Search
• Interpolation Search

Critical Section

• Dekker's Algorithm
• Turn Algorithm
• Flag Algorithm
• Peterson's Algorithm
• Bakery Algorithm
• Test and Set
• Swap
• Semaphore
• Counting Semaphore
• Binary Semaphore