binary-tree-inorder-traversal

< Previous 　　　　　　　　　　　　　　　　 Next >

94. Binary Tree Inorder Traversal (Easy)

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?

Related Topics

[Stack] [Tree] [Depth-First Search] [Binary Tree]

Similar Questions

1. Validate Binary Search Tree (Medium)
2. Binary Tree Preorder Traversal (Easy)
3. Binary Tree Postorder Traversal (Easy)
4. Binary Search Tree Iterator (Medium)
5. Kth Smallest Element in a BST (Medium)
6. Closest Binary Search Tree Value II (Hard)
7. Inorder Successor in BST (Medium)
8. Convert Binary Search Tree to Sorted Doubly Linked List (Medium)
9. Minimum Distance Between BST Nodes (Easy)