Amazon | SDE-1 | Phone screen
SDE
1996
AmazonSeattlePhone ScreeningInterview

Given a tree that is a valid binary expression tree, return the expression as a string

    *
   / \
  +   c
 / \
a   b
Input: root
Output: "(a+b)*c"

      *
     / \
    -   d
   / \
  *   c
 / \
a   b
Output = "((a*b)-c)*d"
Comments (8)