← Questions
Serialize an expression tree with the fewest parentheses
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a binary expression tree of numbers and operators, print it as an infix expression using only the parentheses that precedence and associativity require (for example, keep them in a - (b - c) but not in (a * b) + c).
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding