Serialize an expression tree with the fewest parentheses

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).