Binary Tree Inorder Traversal
You are given the root of a binary tree. Your task is to return the inorder traversal of the tree.
Examples
Input: root = [1,null,2,3]
Output: [1,3,2]
Explanation: The nodes are visited in Left → Root → Right order.
Input: root = [4,2,6,1,3,5,7]
Output: [1,2,3,4,5,6,7]
Explanation: The inorder traversal visits the left subtree, root, and then the right subtree.
Input: root = []
Output: []
Explanation: The tree is empty.
Constraints
- 0 = Number of nodes = 105
- -10? = Node.data = 10?
Companies
Topics
Solution.cs C#JavaPythonC++Javascript
Unlock the code editor
Sign in to write, run, and submit your solution against the full test suite.
- Run code against sample & hidden test cases
- Save submissions and track your streak
- Compare with editorial & community solutions