×

Learn basic concept of c , c++ and python programming in regularcodes.com

# Post order traversal of binary tree without recursion

Postorder tree traversal without using recursion. Simplest method are using a stack. and perform Postorder tree traversal.

Suppose following node are contain in binary tree.

Postorder : 4 2 10 8 30 9 3 1

Function : iterative postorder traversal of binary tree.

View pointers and code execution process.

View stack pointers.

C program for postorder traversal sequences of binary tree. time complexity O(n).

**Output**

View comments and participate Discussion