Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

History

6 Commits

Repository files navigation

Usage

image

Test data

Aspect TestedTestExpected OutcomeActual Outcome
+ operator1 3 +(1+3)(1+3)
- operator1 3 -(1-3)(1-3)
* operator1 3 *(1*3)(1*3)
/ operator1 3 /(1/3)(1/3)
Infix expression with parentheses1 2 + 3 4 + *((1+2)*(3+4))((1+2)*(3+4))
Expression without spaces1 4 3*+ 2+((1+(4*3))+2)((1+(4*3))+2)
Invalid operator1 2 + 3 + 4 &Invalid token &Invalid token &
Invalid token beginning with a digit1a 3 +Invalid token aInvalid token a

About

Postfix to Infix converter built on binary Expression Tree. To convert the tree to Infix expression the inorder tree traversal is applied. Implemented in Java with GUI

Topics

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages