- A basic calculator implemented with stack
- A basic merge_sort alg
- A basic insertion sort alg
- A basic quick sort alg
- A basic compare function comparing time cost between quick_sort, insertion_sort, and hybrid_quick_sort
- A binary tree which will print the whole tree in 2-D graph
- You can type 'help' to show all available cmd
- A basic selection alg which take input.txt as input
- A uncompleted black red tree which doesn't support del function
- A program which will show the order to multiple several matrix which take least computations via DP
- A program which will show the way to cut the rod for best interest via DP
- A program intented to solve the 0_1_knapsack problem via DP
- A program which introduce a way to travel a binary tree in preOrder/inOrder in O(1) space without recursion/stack/queue
- Also introduce a way to invert a binary tree in O(1) space without recursion/stack/queue