Skip to content

Muhammedsuwaneh/expression-evaluator

Repository files navigation

The Program using 2 techniques to solve the problems

  1. First the expression is converted to a postfix using the reverse Polish Algorithm and Stacks ADT
  2. The Postfix notation is then evaluated using Vectors Stack ADTs

About

Evaluating Expression strings using Stack ADT

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages