#Recursive Programs Repo
not the typical infix expression evaluation. done using recursion.
S -> E + E | E - E | E * E| E / E| number.
just swap the two characters and send the rest of the string into reursion.
"Do not unfold the recursion! :)"
Done in DFS fashion
Emma and Sum Of Products from hackerrank!