LeetCode 144 -Binary Tree Preorder Traversal ( JAVA )

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 a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    List<Integer> al = new ArrayList<Integer>();
    public List<Integer> preorderTraversal(TreeNode root) {
        if(root!=null){
            al.add(root.val);
            preorderTraversal(root.left);
            preorderTraversal(root.right);
        }
        return al;
    }
}

总结：博主，建立了一个全局的链表，之后运用递归向链表al插入值。