terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#145
Binary Tree Postorder Traversal
Easy
Acceptance 0%
Editorial
description
Problem Description
Given the root of a binary tree, return the postorder traversal of its nodes' values.
checklist
Constraints
See problem description for detailed constraints.
science
Examples
Case #1
In:
# See problem description for input format
Out:
# Expected output
Mastery Tags
Recursion
Stack
Trees
Hiring Companies
Google
Microsoft
code
Integrated IDE
Python 3
expand_more
C
C++ 17
Java
JavaScript
Python 3
C
C++ 17
Java
JavaScript
Python 3
refresh
class Solution: def binaryTreePostorderTraversal(self, *args): # Write your solution here pass
Login to Compile
Processing
terminal
Debug Output
home
Home
extension
Practice
robot_2
login
Sign In
account_circle
Menu
code_blocks
Coding
psychology
Aptitude
Navigation
close
Login
Registration