LeetCode 144.Binary Tree Preorder Traversal

LeetCode 144.Binary Tree Preorder Traversal

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

For example:
Given binary tree [1,null,2,3],

   1
    \
     2
    /
   3

return [1,2,3].

方法1：递归方法
public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> res=new ArrayList<>();
        preorderTree(res,root);
        return res;
    }
    public void preorderTree(List<Integer> list,TreeNode root){
        if(root!=null){
            list.add(root.val);
            if(root.left!=null)   preorderTree(list,root.left);
            if(root.right!=null)   preorderTree(list,root.right);
        }
    }

方法二：利用栈通过迭代方式实现
public List<Integer> preorderTraversal(TreeNode root) {
           List<Integer> res=new ArrayList<>();
           Stack<TreeNode> stack=new Stack<>();
           if(root==null) return res;
           stack.add(root);
           while(!stack.isEmpty()){
               TreeNode temp=stack.pop();
               res.add(temp.val);
               if(temp.right!=null){
                   stack.add(temp.right);
               }
               if(temp.left!=null){
                   stack.add(temp.left);
               }
           }
           return res;
    }