【leetcode】94. Binary Tree Inorder Traversal

94. Binary Tree Inorder Traversal

https://leetcode.com/problems/binary-tree-inorder-traversal/?tab=Description

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

For example:
Given binary tree [1,null,2,3],
1
\
2
/
3
return [1,3,2].

思路

题目需要我们中序遍历，所以用一个stack来储存所有左节点的值，使用递归思路，直到root节点为null

代码

public List<Integer> inorderTraversal(TreeNode root) {
    List<Integer> list = new ArrayList<Integer>();

    Stack<TreeNode> stack = new Stack<TreeNode>();
    TreeNode cur = root;

    while(cur!=null || !stack.empty()){
        while(cur!=null){
            stack.add(cur);
            cur = cur.left;
        }
        cur = stack.pop();
        list.add(cur.val);
        cur = cur.right;
    }

    return list;
}