Binary Search Tree
Create a program that accepts string as an input. The program will determine how many nodes the user wants to enter. After the strings are entered, the program will create a binary search tree and output the following traversals: Pre-order, post-order, and in-order. Assume that N is the number of nodes, N should be <= 20 and >=0. Do not forget to output also the binary search tree before the traversals.
I don't know what is more intriguing, the fact that you believe that people here will do your homework (for free) or that you can't copy the code from wikipedia, it's a BST, dammit.