leetcode------Binary Tree Inorder Traversal

标题：	Binary Tree Inorder Traversal
通过率：	36.1%
难度：	中等

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].

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

二叉树的中序遍历，直接看代码：

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        ArrayList<Integer> result=new ArrayList<Integer>();
        vistTree(result,root);
        return result;
    }
    public void vistTree(List<Integer> temp,TreeNode root){
        if(root!=null){
            vistTree(temp,root.left);
            temp.add(root.val);
            vistTree(temp,root.right);
        }
    }
}