Type of question :
- infix expression ð binary tree
- binary tree ð prefix, infix, posfix
- postfix ð infix
- infix + prefix ð draw tree
Type 1
Using Infix to derive binary tree
Question 3
Rewrite the following infix expressions in a fully bracketed form, and then convert them into their post-fix forms.
(A + B) x C - D [2 marks]
Click here for answerA x B/ (C+D^E) / F ^ G [3 marks]
Click here for answerA ^ B - C x D + E / F / (G + H) [4 marks]
Click here for answer
1997 Dec Progress Test Set 3
Draw the binary tree for the following infix expression:
c + d / e / f * g + h * i
Last updated 16th January 1998