94. Binary Tree Inorder Traversal

Easy

Stack,Tree,Depth-First Search,Binary Tree

---

Given the root of a binary tree, return the inorder traversal of its nodes' values.

 

Example 1:

Input: root = [1,null,2,3]
Output: [1,3,2]

Example 2:

Input: root = []
Output: []

Example 3:

Input: root = [1]
Output: [1]

 

Constraints:

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

 

Follow up: Recursive solution is trivial, could you do it iteratively?

---

Submissions

Time Submitted	Status	Runtime	Memory	Language
08/17/2022 13:55	Accepted	6 ms	8.4 MB	cpp
08/30/2021 11:50	Accepted	0 ms	10.4 MB	cpp
08/13/2021 14:31	Accepted	0 ms	10.2 MB	cpp
08/13/2021 14:26	Wrong Answer	N/A	N/A	cpp