二叉树的中序遍历

最新推荐文章于 2019-09-30 21:00:51 发布

suv1234

最新推荐文章于 2019-09-30 21:00:51 发布

阅读量210

点赞数

分类专栏：面试算法

本文链接：https://blog.youkuaiyun.com/suv1234/article/details/72830215

版权

面试算法专栏收录该内容

39 篇文章

订阅专栏

public ArrayList<Integer> inorderTraversal(TreeNode root) {
        Stack<TreeNode> stack = new Stack<TreeNode>();
        ArrayList<Integer> result = new ArrayList<Integer>();
        TreeNode curt = root;
        while (curt != null || !stack.empty()) {
            while (curt != null) {
                stack.add(curt);
                curt = curt.left;
            }
            curt = stack.peek();
            stack.pop();
            result.add(curt.val);
            curt = curt.right;
        }
        return result;
    }
}