94. Binary Tree Inorder Traversal

link: https://leetcode.com/problems/binary-tree-inorder-traversal/

Solution1：recursive递归

class Solution {
    public void helper(TreeNode root, ArrayList<Integer> res) {
        if(root.left != null) helper(root.left, res);
        res.add(root.val);
        if(root.right != null) helper(root.right, res);
    }
    
    public List<Integer> inorderTraversal(TreeNode root) {
        ArrayList<Integer> res = new ArrayList<>();
        if(root == null) return res;
        helper(root, res);
        return res;
    }
}

Solution2：iteration 迭代

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        Stack stack = new Stack();
        if(root == null) return res;
        while(root != null || !stack.empty()) {
            while(root != null) {
                stack.push(root);
                root = root.left;
            }
            root = (TreeNode)stack.pop();
            res.add(root.val);
            root = root.right;
        }
        return res;
    }
}