Method inorderTraversal

TreeInorder.java:9–13

(TreeNode root)

	        inorder(node.right,list);
	    }
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<Integer>();
        inorder(root,list);
        return list;
    }
}