94. Binary Tree Inorder Traversal
Easy
Given the root
of a binary tree, return the inorder traversal of its nodes' values.
Example 1:
Example 2:
Example 3:
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?
解題
Runtime: 0 ms, faster than 100%
Memory Usage: 1.9 MB, less than 89.14%
Last updated