terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#94
Binary Tree Inorder Traversal
Easy
Acceptance 0%
Editorial
description
Problem Description
Given the `root` of a binary tree, return the inorder traversal of its nodes' values.
checklist
Constraints
The number of nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100
science
Examples
Case #1
In:
root = [1,null,2,3]
Out:
[1,3,2]
Case #2
In:
root = []
Out:
[]
Mastery Tags
Recursion
Stack
Trees
Hiring Companies
Amazon
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 TreeNode: def __init__(self, val=0, left=None, right=None): self.val = val; self.left = left; self.right = right class Solution: def inorderTraversal(self, root: TreeNode) -> list[int]: 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