分治法实现前序遍历

样例

给出一棵二叉树 {1,#,2,3},

   1
    \
     2
    /
   3

 返回 [1,2,3].

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
 
import java.util.ArrayList;
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: Preorder in ArrayList which contains node values.
     */
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        // write your code here
        ArrayList<Integer> result=new ArrayList<Integer>();
        
		if(root==null) {
			return result;
		}
		
		ArrayList<Integer> left=preorderTraversal(root.left);
		ArrayList<Integer> right=preorderTraversal(root.right);
		
		result.add(root.val);
		result.addAll(left);
		result.addAll(right);
		
		return result;
    }
}