Repo contains following playground Haskell projects:
Allows to create binary tree and draw it using level traversal from top to bottom
Solver is able to convert infix notation to postfix notation and then calculate score using Reverse Polish Notation
Solver supports:
- addition
- subtraction
- brackets priority
example equation that can be calculated:
1+(150-200)+((20+(10)+80)-(160-50))+88