public int sumNumbers(TreeNode root) {
		int sum = 0;
		List<Integer> result = new ArrayList<Integer>();
		if (root == null)
			return sum;
		build(result, 0, root);
		for (int i : result) {
			sum += i;
		}
		return sum;
	}