자료구조 : 시작하기

목차

0. 자료구조란?

 

1. ADT(Abstract Data Type)

 

2. 배열 (Array)

 

3. 연결 리스트(Linked List)

- Single Linked List

- Double Linked List

 

4. 스택(Stack)

- prefix, postfix, infix

 

5. 큐(Queue)

- Array Implementation of a Queue

- Linked List Implementation of a Queue

- 우선순위 큐(Priority Queue)

 

6. 재귀(Recursion)

 

7. 트리(Tree)

- 이진 트리(Binary Tree)

- Complete Binary Tree

- Binary Search Tree : Pre-order, In-order, Post-order

 

8. 힙(Heap)

- Priority Queue ADT with Heap

- B-Tree

 

9. 탐색(Search)

- Serial Search

- Binary Search

 

10. 해쉬(Hashing)

- open-addressing Hashing

- Collision

- Linear probing

- Double Hashing

- Chained Hashing

 

11. 정렬(Sorting)

- Selection Sort

- Insertion Sort

- Merge Sort

- Quick Sort

- Heap Sort

 

12. 그래프(Graph)

- Depth First Search

- Breadth First Search

- Shortest Distance Algorithm