[工作] Data Structure & Algorithm

Big O比較
n! > 2^n > n^2 > n log n > n > log n > 1

Stack: push / pop O(1)
Queue: add / remove O(1)

Binary Search Tree
find: O(log n)