← Amazon questions

Evaluate an Expression Tree

Filed under Amazon

Write code to evaluate an expression tree (binary tree where leaves are operands and internal nodes are operators like +, -, *, /) using post-order traversal.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.