could somebody please tell me what (A*B) / (C^D^E) is in POST ORDER.

I drew the tree and went back over it in post order

From this I get :Code:`/`

* ^

A B C ^

D E

AB*C/D^E^, is this correct?

Printable View

- 11-28-2012, 06:55 PMsim18Could somebody check my binary tree?
could somebody please tell me what (A*B) / (C^D^E) is in POST ORDER.

I drew the tree and went back over it in post order

Code:`/`

* ^

A B C ^

D E

AB*C/D^E^, is this correct? - 11-28-2012, 07:08 PMKevinWorkmanRe: Could somebody check my binary tree?
First off, define exactly what you mean by post order.

I might point out that AB*C/D^E^ isn't a valid expression. - 11-28-2012, 07:15 PMeRaaaaRe: Could somebody check my binary tree?
Tree traversal - Wikipedia, the free encyclopedia

To traverse a non-empty binary tree in postorder, perform the following operations recursively at each node[1]:

Traverse the left subtree.

Traverse the right subtree.

Visit the root.

@Kevin: I think the "right" postorder traversation will generate a non "valid expression" too.... - 11-28-2012, 07:21 PMKevinWorkmanRe: Could somebody check my binary tree?
- 11-28-2012, 07:36 PMJosAHRe: Could somebody check my binary tree?
The correct postfix expression (according to your tree) is: AB*CDE^^/

kind regards,

Jos - 11-28-2012, 07:39 PMJosAHRe: Could somebody check my binary tree?
- 11-28-2012, 08:11 PMsim18Re: Could somebody check my binary tree?
Thank you very much