Notes π Basic μκ³ λ¦¬μ¦ κΈ°μ΄ π Data Structure μλ£κ΅¬μ‘°(Data Structure) λ°°μ΄(Array)κ³Ό μ°κ²° 리μ€νΈ(Linked List) μ€ν(Stack)κ³Ό ν(Queue) κ·Έλ¦¬κ³ λ±(Deque) νΈλΌμ΄(Trie) π Graph κ·Έλν(Graph) μλ‘μ μ§ν©(Disjoint Set)κ³Ό Union-Find μκ³ λ¦¬μ¦ DAG(Directed Acyclic Graph)μ μμμ λ ¬(Topological Sort) π Sort ν΅μ λ ¬(QuickSort)