leetcode学习笔记94 Binary Tree Inorder Traversal

开始之前

问题

Binary Tree Inorder Traversal

Given the root of a binary tree, return the inorder traversal of its nodes’ values.

Follow up:

Recursive solution is trivial, could you do it iteratively?

思考

基础.

方法1

标准的递归中序遍历.

时间复杂度$O(n)$.
空间复杂度$O(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<Integer>();
        helper(root, list);
        return list;
    }
    
    private void helper(TreeNode node, List<Integer> list){
        if(node == null)
            return;
        
        helper(node.left, list);
        list.add(node.val);
        helper(node.right, list);
    }
}

方法2

递归是标准解法,我们来试试不用递归,用stack 来做.每次先依次把左节点放入stack, 然后尝试找右节点.

时间复杂度$O(n)$.
空间复杂度$O(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 {
    public List<Integer> inorderTraversal(TreeNode root) {
        // result
        List<Integer> res = new ArrayList<Integer>();
        // stack
        Deque<TreeNode> que = new ArrayDeque<TreeNode>();
        TreeNode node = root;
        while(!que.isEmpty() || node != null){
            
            // 依次将左节点放入stack
            while(node != null){
                que.push(node);
                node = node.left;
            }
            
            // 将最左的节点取出,并放入res
            node = que.pop();
            res.add(node.val);
            
            // 尝试寻找右节点
            node = node.right;
        }
        return res;
    }
}