算法：二叉树的前序遍历

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]

最典型的二叉树的递归遍历，废话不多说了，极为简单，直接上代码：

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