자료구조

 

• Array vs Linked List
• Stack and Queue
• Tree
  • Binary Tree
  • Full Binary Tree
  • Complete Binary Tree
  • BST (Binary Search Tree)
• Binary Heap
• Red Black Tree
  • 정의
  • 특징
  • 삽입
  • 삭제
• Hash Table
  • Hash Function
  • Resolve Collision
    • Open Addressing
    • Separate Chaining
  • Resize
• Graph
  • Graph 용어정리
  • Graph 구현
  • Graph 탐색
  • Minimum Spanning Tree
    • Kruskal algorithm
    • Prim algorithm