public int sumNumbers(TreeNode root) {
		// Start typing your Java solution below
		// DO NOT write main() function
		int[] sumPath = new int[] { 0, 0 };
		if (root != null) {
			dsf(root, sumPath);
		}
		return sumPath[0];
	}