Leetcode 94. 二叉树的中序遍历

给定一个二叉树，返回它的中序 遍历。

输入: [1,null,2,3]
输出: [1,3,2]

1、递归

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

2、迭代

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList();
        print(list,root);
        return list;
    }
    public void print(List<Integer> list,TreeNode root){
        Stack<TreeNode> stack = new Stack();
        TreeNode cur = root;
        while(cur != null || !stack.empty()){
            while(cur != null){
                stack.push(cur);
                cur = cur.left;
            }
            cur = stack.pop();
            list.add(cur.val);
            cur = cur.right;
        }
    }
}