Binary Tree Postorder Traversal Problem

Binary Tree Postorder Traversal Problem — ExecCode Medium DSA Practice

Solve the Binary Tree Postorder Traversal problem on ExecCode. Free online medium DSA practice in Tree. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description Given the root of a binary tree, return the postorder traversal of its nodes' values. Constraints The number of the nodes in the tree is in the range [0, 100]. -100 <= Node.val <= 100

Examples

Input {"data": "1 null 2 3"}; Output 3 2 1. Input {"data": "1 2 3 4 5 6 7"}; Output 4 5 2 6 7 3 1. Input {"data": "1"}; Output 1

Constraints

The number of the nodes in the tree is in the range [0, 100]. -100 <= Node.val <= 100

Practice Binary Tree Postorder Traversal free on ExecCode. Browse DSA problems, topic map, and placement guides.