In-class Assignment 2

Implement the followings.
1. Create a binary tree with 6 nodes.
2. Pre-order, In-order, and Post-order traversals.
3. Create a binary search tree using Insert function. Insert integers 10, 18, 7, 2, 20, 15 sequentially into an empty binary tree.