Arithmetic Exps in BT JAVA

Arithmetic Expressions in Binary Tree:

I have to make an arithmetic calculator which should be able to take arithmetical expression as input from user, make binary tree for expression, and compute the expression to obtain result.

1) I must implement your own binary tree using linked nodes.

2) The program should take an arithmetic expression as input from user. detailed info will be given

3) If mathematical expression is not correct, give an error message and ask the user to input correct expression. (For simplicity, the program can ignore division by zero error in the arithmetic expressionand also look for other errors.)

4) The mathematical expression is changed into postfix form. Postfix is a mathematical notation wherein every operator follows all of its operands. (E.g. postfix for 4*5 = 45*, postfix for 4*5+9/3= 45*93/+). I wrote the code that can convert arithmetic expressions into postfix form, I will send you the code.

5) Once the program has expression in postfix from, it can use it to draw a Binary Tree. For example: Expression: 1+2*3, and its postfix expression: 123*+

Postfix exp must be put in a stack (which must be implemented by the coder).

Linux Instalación de scripts Shell Script Arquitectura de software UNIX

Nº del proyecto: #2724416

Sobre el proyecto