DFS Postorder

Category: Trees & BSTs

Difficulty: beginner

Description: Visit left, right, then root

Time Complexity: O(n)

Space Complexity: O(h)

Related LeetCode Problems

• 145. Binary Tree Postorder Traversal (Easy)
• 114. Flatten Binary Tree to Linked List (Medium)
• 124. Binary Tree Maximum Path Sum (Hard)
• 199. Binary Tree Right Side View (Medium)
• 230. Kth Smallest Element in a BST (Medium)
• 257. Binary Tree Paths (Easy)
• 863. All Nodes Distance K in Binary Tree (Medium)
• 437. Path Sum III (Medium)
• 112. Path Sum (Easy)
• 129. Sum Root to Leaf Numbers (Medium)
• 687. Longest Univalue Path (Medium)
• 297. Serialize and Deserialize Binary Tree (Hard)
• 114. Flatten Binary Tree to Linked List (duplicate) (Medium)
• 889. Construct Binary Tree from Preorder and Postorder Traversal (Medium)