trees describe non-recursive algorithm for doing an inorder traversal of tree hintyour algorithm will need stack to get this to work write some code to build tree for the infix expression be sure to follow the precedence of operators and in your tree you may assume the plusnode and timesnode classes from the are already defined provide the prefix and postfix forms of programming problems write program that asks the user to enter prefix expression thenthe program should print out the infix and postfix forms of that expression finallyit should print the result of evaluating the expression interacting with the program should look like this please enter prefix expression the infix form is((( the postfix form is the result is if the prefix expression is malformedthe program should print that the expression is malformed and it should quit it should not try to print the infix or postfix forms of the expression in this case write program that reads list of numbers from the user and lets the user insertdeleteand search for values in the tree the program should be menu driven allowing for insertingsearchingand deleting from binary search tree inserting into the tree should allow for multiple inserts as follows binary search tree program make choice insert into tree delete from tree lookup value choice insert insert insert insert insert insert insert insert insertmake choice insert into tree delete from tree lookup value choice value yes is in the tree this copy belongs to 'acha