Answer to Question #60485 in C# for oren

Question

below shows the postfix epression. Draw a binary tree of abc * + de * f + g +

and find the following
i.infix expression

ii.prefix expression

From the traverssl of predorder , inorder and postorder as above write down the c++ statement for each

i.predorder function
ii.inorder function