(Data_Structure) 자료 구조 종류 모음

1. Array 

- Array List : https://hyul-code.tistory.com/2

ADT : begin(), end(), size(), empty(), insertFront(), insertBack(),

removeFront(), removeBack(), insert(), remove()

 

- Vector : https://hyul-code.tistory.com/61

ADT : at(), set(), insert(), erase(), size(), empty()

 

 

2. Linked Lists

- Singly Linked List  : https://hyul-code.tistory.com/3

ADT : front(), addFront(), removeFront(), addBack(), removeBack(), empty()

 

- Doubly Linked List : https://hyul-code.tistory.com/3

ADT : begin(), end(), size(), empty(), insertFront(), insertBack(),

removeFront(), removeBack(), insert(), remove()

 

 

3. Stacks 

- Stack : https://hyul-code.tistory.com/17

ADT : push(), pop(), top(), size(), empty()

 

 

4. Queue

- Queue  : https://hyul-code.tistory.com/18

 

- Priority Queue : https://hyul-code.tistory.com/62

ADT : insert(), removeMin(), min(), size(), empty()

 

- Deque : https://hyul-code.tistory.com/20

 

 

5. Dictionaries 

- Dictionary

ADT : find(), put(), end(), erase(), size(), empty()

 

- Hash Tables

 

 

6. Tree

- Tree

ADT : root(), positions(), parent(), children(), size(), empty(), isRoot(), isExternal() 

 

- Binary Tree

ADT : root(), positions(), parent(), children(), size(), empty(), isRoot(), isExternal() 

left(), right()

 

- Decision Tree

 

- Binary Search Tree

 

- Heaps

 

- AVL

 

 

7. Graphs

- Graph

ADT : e.endVertices(), e.opposite(), u.isAdjacentTo(), *v, *e, 

insertVertex(), insertEdge(), eraseVertex(), eraseEdge(), incidentEdges(), vertices(), edges()

 

- Directed Graphs (Digraphs)

 

- Undirected Graphs