[go: up one dir, main page]

Skip to content

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

License

Notifications You must be signed in to change notification settings

MovieTone/PostfixToInfixExpressionTree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Usage

image

Test data

Aspect Tested Test Expected Outcome Actual Outcome
+ operator 1 3 + (1+3) (1+3)
- operator 1 3 - (1-3) (1-3)
* operator 1 3 * (1*3) (1*3)
/ operator 1 3 / (1/3) (1/3)
Infix expression with parentheses 1 2 + 3 4 + * ((1+2)*(3+4)) ((1+2)*(3+4))
Expression without spaces 1 4 3*+ 2+ ((1+(4*3))+2) ((1+(4*3))+2)
Invalid operator 1 2 + 3 + 4 & Invalid token & Invalid token &
Invalid token beginning with a digit 1a 3 + Invalid token a Invalid token a