Back to Questions

Binary Tree Postorder Traversal (Iterative)

123.3K views•Asked at Airbnb•
Hard

Question Explain

Given the root of a binary tree, return the postorder traversal of its nodes' values. Implement the solution iteratively (most complex of the three traversals).

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Reverse a Linked List

46K views

Kth Smallest Element in a BST

94.8K views

Lowest Common Ancestor of a BST

74.7K views
Binary Tree Postorder Traversal (Iterative) - Interview Question