binary-tree-inorder-traversal

< Previous 　　　　　　　　　　　　　　　　 Next >

94. Binary Tree Inorder Traversal (Medium)

Given a binary tree, return the inorder traversal of its nodes' values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

Follow up: Recursive solution is trivial, could you do it iteratively?

Related Topics

[Stack] [Tree] [Hash Table]

Similar Questions

1. Validate Binary Search Tree (Medium)
2. Binary Tree Preorder Traversal (Medium)
3. Binary Tree Postorder Traversal (Hard)
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)