Chapter 3. Simple binary tree with insert and printing in order
Implemented Exercise 3-1 (Parentheses matching) using stacks
Implemented 3-20 as MiddleNode.java. "Write a function to find
the midle node of a singly-linked list" with and without size.
Worked on reverse linked list a bit
Finished reverse linked list