Problem Submissions Solution
Postorder Traversal Of Binary Tree
Difficulty: Easy
Acceptance: %
Points: 20.00
Post-order traversal first visits the left child (including its entire subtree), then visits the right child (including its entire subtree), and finally visits the node.
Given a Binary Tree, your task is to return its Post-Order Traversal.
Examples:
Expected Time Complexity: O(n)
Expected Auxiliary Space: O(log n) for recursive calls + O(n)
Constraints:
- 1 <= number of nodes <= 10^5
- 0 <= node->data <= 10^5
Companies:
Walmart Morgan Stanly
Topics:
Tree
