Tree Traversal Postorder Left Right Root in DSA Javascript - Execution Trace

Concept Flow - Tree Traversal Postorder Left Right Root

Start at root node

↓

Traverse left subtree

↓

Traverse right subtree

↓

Visit current node (root)

↓

Back to parent node

↓

Repeat until all nodes visited

The traversal visits left subtree first, then right subtree, and finally the root node, recursively.

Execution Sample

DSA Javascript

function postorder(node) {
  if (!node) return;
  postorder(node.left);
  postorder(node.right);
  console.log(node.value);
}

This code prints nodes of a binary tree in postorder: left, right, then root.

Execution Table

Step	Operation	Node Visited	Pointer Changes	Tree State (Visual)
1	Start at root	A	current = A	A / \ B C
2	Traverse left subtree	B	current = B	A / \ B C
3	Traverse left subtree of B	D	current = D	A / \ B C / D
4	Visit D (leaf)	D	print D	A / \ B C / D
5	Traverse right subtree of B	E	current = E	A / \ B C / \ D E
6	Visit E (leaf)	E	print E	A / \ B C / \ D E
7	Visit B (after children)	B	print B	A / \ B C / \ D E
8	Traverse right subtree	C	current = C	A / \ B C / \ D E F
9	Traverse left subtree of C	F	current = F	A / \ B C / \ D E F
10	Visit F (leaf)	F	print F	A / \ B C / \ D E F
11	Traverse right subtree of C	G	current = G	A / \ B C / \ D E F \ G
12	Visit G (leaf)	G	print G	A / \ B C / \ D E F \ G
13	Visit C (after children)	C	print C	A / \ B C / \ D E F \ G
14	Visit A (root after children)	A	print A	A / \ B C / \ D E F \ G
15	Traversal complete	None	None	All nodes visited in postorder: D E B F G C A

💡 All nodes visited in postorder; recursion ends when node is null.

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	After Step 4	After Step 5	After Step 6	After Step 7	After Step 8	After Step 9	After Step 10	After Step 11	After Step 12	After Step 13	After Step 14	Final
current	root (A)	A	B	D	D	E	E	B	C	F	F	G	G	C	A	None
printed_nodes	[]	[]	[]	[]	[D]	[D]	[D, E]	[D, E, B]	[D, E, B]	[D, E, B]	[D, E, B, F]	[D, E, B, F]	[D, E, B, F, G]	[D, E, B, F, G, C]	[D, E, B, F, G, C, A]	[D, E, B, F, G, C, A]

Key Moments - 3 Insights

Why do we print the node value after traversing left and right children?

Because postorder means visiting left subtree, then right subtree, and only then the root node. This is shown in execution_table rows 4, 6, 7, 10, 12, 13, and 14 where printing happens after children are visited.

What happens when a node has no children?

The function prints the node immediately since left and right recursive calls return immediately (null). This is shown in steps 4, 6, 10, and 12 where leaf nodes D, E, F, G are printed.

How does the traversal know when to stop?

When the node is null, the function returns without action. This base case stops recursion and is the reason traversal ends after all nodes are visited, as noted in exit_note.

Visual Quiz - 3 Questions

Look at the execution_table at step 7, which nodes have been printed so far?

A [D, E, B, F]

B [D, E]

C [D, E, B]

D [D, E, B, F, G]

💡 Hint

Check the 'printed_nodes' variable in variable_tracker after step 7.

At which step does the traversal visit the root node 'A'?

A Step 13

B Step 14

C Step 15

D Step 12

💡 Hint

Look at the 'Node Visited' and 'Operation' columns in execution_table.

If node 'C' had no right child, how would the printed order change?

A G would be missing, printed order ends with F C A

B No change, G is printed anyway

C Traversal would stop early at C

D Node C would be printed before F

💡 Hint

Refer to the traversal order in execution_table and consider missing right subtree of C.

Concept Snapshot

Postorder traversal visits nodes in Left → Right → Root order.
Use recursion: traverse left subtree, then right subtree, then visit node.
Print or process node only after children.
Base case: if node is null, return immediately.
Common for tree algorithms needing bottom-up processing.

Full Transcript

Postorder traversal means visiting the left subtree first, then the right subtree, and finally the root node. The code uses recursion to do this. It starts at the root, goes left until it hits a leaf, prints that leaf, then goes right, prints that leaf, and finally prints the parent node. This repeats up the tree until all nodes are printed. The base case is when the node is null, which stops recursion. The printed order for the example tree is D, E, B, F, G, C, A.