94. Binary Tree Inorder Traversal(二叉树中序遍历)

题目链接：https://leetcode.com/problems/binary-tree-inorder-traversal/

方法一：

递归实现：

AC 0ms 100% Java:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private List<Integer> ans=new ArrayList();
    public List<Integer> inorderTraversal(TreeNode root) {
        if(root==null)
            return ans;
        helper(root);
        return ans;
    }
    public void helper(TreeNode root){
        if(root==null)
            return;
        helper(root.left);
        ans.add(root.val);
        helper(root.right);
    }
}

方法二：

辅助栈迭代法：思路和递归有些类似，只不过用栈来存储节点。

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