Input two lists of integers/characters where the first list is preorder traversal and the second list is the postorder traversal. Place both lists in separate linked lists and create the binary tree they represent. The out put should be the inorder, preorder, postorder and level by level traversal of the binary tree. The level by level should have the appropriate number of nodes on each line. you should print out the level by level in a form that represents the binary tree.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
Microsoft Visual C++ 6