Leetcode-binary-tree-preorder-traversal

题目描述

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

For example:
Given binary tree{1,#,2,3},

   1
    \
     2
    /
   3

return[1,2,3].

Note: Recursive solution is trivial, could you do it iteratively?

上一篇博文中提到了相同的方法可以解决先序遍历和后序遍历的问题。

import java.util.*;
public class Solution {
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        	ArrayList<Integer> rets=new ArrayList<Integer>();
	        preorder(root,rets);
	        return rets;
    }
    	    public void preorder(TreeNode root, ArrayList<Integer> rets){
	        if(root!=null){
	            rets.add(root.val);
	            preorder(root.left,rets);
	            preorder(root.right,rets);
	        }
	    }
}