15. DFS Postorder

Easy

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: root = [1, null, 2, 3]

Output: [3, 2, 1]

Explanation: The postorder traversal is left subtree (3), right subtree (2), then root (1).

Example 2:

Input: root = []

Output: []

Explanation: An empty tree results in an empty traversal.

Example 3:

Input: root = [1]

Output: [1]

Explanation: A single-node tree simply returns the node's value.

Constraints:

•
•

Time Complexity

O(n)

Space Complexity

O(h)

15. DFS Postorder

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases

15. DFS Postorder

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases