Q 1 (a) Let E denote the following algebraic expression: [ a + ( b - c) ] * [ ( d - e) / ( f + g - h ) ].
Create a binary tree from the above expression E and also provide the preorder and postorder
traversal of the tree and compare them with prefix and postfix notation of the expression E
Mathbot Says...
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.