LeetCode144-二叉树的前序遍历

LeetCode144-二叉树的前序遍历

题目

解法

方法一：递归

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

方法二：迭代

/**
 * 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> preorderTraversal(TreeNode root) {
        List<Integer> res = new LinkedList<>();
        if(root==null) return res;
        TreeNode cur = root;
        Stack<TreeNode> st = new Stack<>();
        while(!st.isEmpty()||cur!=null){
            while(cur==null&&!st.isEmpty()){
                cur = st.pop().right;
            }
            if(cur == null) return res;
            st.push(cur);
            res.add(cur.val);
            cur = cur.left;
        }
        return res;
    }
}