Given the root of a binary tree, return the inorder traversal of its nodes’ values.
Follow up: A recursive solution is trivial. Could you solve it iteratively?
Constraints:
The number of nodes in the tree is in the range
Node.val
Given the root of a binary tree, return the inorder traversal of its nodes’ values.
Follow up: A recursive solution is trivial. Could you solve it iteratively?
Constraints:
The number of nodes in the tree is in the range
Node.val