Activity # 1.
Create a program that inserts nodes using a binary search tree.
Use an array structure to represent nodes of the trees.
Activity # 2.
Create a program that traverses a binary tree.
Use the preorder, inorder, and postorder traversals.