题目

题目链接

https://leetcode.cn/problems/binary-tree-inorder-traversal/?envType=study-plan-v2&envId=top-100-liked

解题思路

看官方题解
https://leetcode.cn/problems/binary-tree-inorder-traversal/solutions/412886/er-cha-shu-de-zhong-xu-bian-li-by-leetcode-solutio/?envType=study-plan-v2&envId=top-100-liked

相关代码

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