Leetcode-94. 二叉树的中序遍历（JAVA）

给你二叉树的根节点 root ，返回它节点值的中序遍历。

示例 1：

输入：root = [1,null,2,3]
输出：[1,2,3]

 

示例 2：

输入：root = []
输出：[]

示例 3：

输入：root = [1]
输出：[1]

示例 4：

输入：root = [1,2]
输出：[1,2]
示例 5：

 

输入：root = [1,null,2]
输出：[1,2]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/binary-tree-inorder-traversal/

1.递归

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

}

2.栈方法

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    List<Integer> res = new ArrayList<>();
    public List<Integer> inorderTraversal(TreeNode root) 
    {
        inorder(root);
        return res;
    }
    private void inorder(TreeNode root)
    { 
        Stack<TreeNode> tStack = new Stack<>();
        while (root!= null || !tStack.isEmpty())
        {
            if(root!=null)
            {
                tStack.push(root);
                root = root.left;
            }
            else
            {
                root = tStack.pop();
                res.add(root.val);
                root = root.right;
            }
        }
    }
}