LeetCode -- Binary Tree Inorder Traversal

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public IList<int> InorderTraversal(TreeNode root) 
    {
        Travel(root);
    	return result;
    }
    private void Travel(TreeNode node){
    
    	if(node == null){
    		return ;
    	}
    	
    	Travel(node.left);
    	result.Add(node.val);
    	Travel(node.right);
    }
    
    private IList<int> result = new List<int>();
}

LeetCode -- Binary Tree Inorder Traversal

原文：http://blog.csdn.net/lan_liang/article/details/48575897