LeetCode 94 -Binary Tree Inorder Traversal ( JAVA )

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

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

   1
    \
     2
    /
   3

return [1,3,2].

/**
 * 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> inorderTraversal(TreeNode root) {
        if(root!=null){
            inorderTraversal(root.left);
            al.add(root.val);
            inorderTraversal(root.right);
        }
        return al;
    }
}

总结：没啥总结的- -，一个递归调用就OK了，写了一个全局的Arraylist；