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]
Example 4:
Input: root = [1,2] Output: [2,1]
Example 5:
Input: root = [1,null,2] Output: [1,2]
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?
[Stack] [Tree] [Depth-First Search] [Binary Tree]
- Validate Binary Search Tree (Medium)
- Binary Tree Preorder Traversal (Easy)
- Binary Tree Postorder Traversal (Easy)
- Binary Search Tree Iterator (Medium)
- Kth Smallest Element in a BST (Medium)
- Closest Binary Search Tree Value II (Hard)
- Inorder Successor in BST (Medium)
- Convert Binary Search Tree to Sorted Doubly Linked List (Medium)
- Minimum Distance Between BST Nodes (Easy)