Binary Tree Inorder Traversal
You are given the root of a binary tree. Return the values of the tree in inorder: the whole left subtree, then the node, then the whole right subtree. An empty tree gives an empty list.
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [1,2,3]
returns [2,1,3]
Left child 2 first, then 1, then right child 3.
Example 2
root [1,null,2,3]
returns [1,3,2]
1 has no left child, so 1 comes first; then 3, 2.
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Trees problems
- Binary Tree Postorder TraversalBeginner
- Binary Tree Preorder TraversalBeginner
- Collect the LeavesBeginner
- Count the LeavesBeginner
- Full Binary Tree CheckBeginner
- Is It a Single ChainBeginner
- Nodes With Exactly One ChildBeginner
- Replace Values With DepthBeginner