Representing expressions using binary trees

In-order traversal:

(A+B)*C -- infix

Pre-order traversal:

*+ABC -- prefix

Post-order traversal:

AB+C* -- postfix

Previous slide

Back to first slide

View graphic version