easy java project

Any tree can be transformed into a binary (here "binary" means that every node has at most two children) tree by first deleting from each node all the links to its children except the link to its leftmost child, and then setting a link from each node to its immediate right sibling. a) Write a procedure which takes a tree as input and produces its corresponding binary tree. The input tree is given by listing, for every node, the children of that node. Nodes are represented by integers. For example, the following representation: 1 2 3 4 5 2 6 3 7 8 denotes a tree having a root 1 with children 2,3,4 and 5; node 2 has one child, i.e., node 6; node 3 has children 7 and 8. Leaves (nodes with no children) will not have a separate input line; they will merely appear on the child list of another node. For simplicity you may assume that the nodes of the tree will be input in level order. b) Let now T be a tree and F be the binary tree equivalent to T under the above transformation. Write a function that accepts F as input and returns the height of T. c) Write a procedure that accepts F and a node v and returns first all the descendants of v in T and then all the ancestors of v in T. The ancestors of v in T must be output with the following format: print the list of all the ancestors of v in F; in this list, mark the ancestors of v in T by appending an asterisk to each. To test your procedures, your main program should call all three procedures and print their results. Specifically, a) Call the first procedure to read in a tree and produce a binary tree. Following this, print out the newly created binary tree in both preorder and postorder. For listing purposes, consider the leftmost-child to be the left child and the right-sibling to be the right child of a node. As you know, a preorder and postorder listing uniquely identifies a binary tree. (You will probably wish to write separate auxiliary procedures to do the predorder and postorder listings.) b) Call the second function to determine the tree's height and print out the resulting value. c) Call the third procedure three times, once each with the nodes labeled 1, 2, and 3. Print the results for each of these 3 calls. ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. ## Platform UNIX needs to run from both the command line and an input file. For an experienced coder (5+ years), this will take you 15 minutes to complete. It would take me about 10 hours, and I don't have 10 hours to spare! ## Deadline information Must be finished by 7/26/02 12:00:00 PM. This is a very easy project that I do not have the time to work on. I have other projects more important to do. An experienced code will finish this in less than a half-hour. Bidding will close down early.