Lab
Binary Expression Trees

Write a program that builds a binary expression tree (BXT) from a given postfix expression, displays the expression in prefix form and evaluates it. Follow these steps in solving this problem:

Extensions


Continue to:  Unit 8 / Prev / Next