← Oracle questions

Iterative post-order traversal of a binary tree

Filed under Oracle

Given the root of a binary tree, return the post-order traversal of its nodes' values iteratively without using recursion.

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 Oracle questions

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