Path Sum II

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

For example: Given the below binary tree and sum = 22,

5
/ \
4
8
/
/ \
11
13
4
/
\
/ \
7
2
5
1

return
[
[5,4,11,2],
[5,8,4,5]
]

#include <iostream>
#include <vector>
using namespace std;

struct TreeNode
{
	int data;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x):data(x),left(NULL),right(NULL) {}
};

//跟上一题相比，本题是求路径本身。且要求出所有结果，左子树求到了满意结果，不能 return，要接着求右子树。
class solution
{
public:
	vector<vector<int>> result;
	void dfs(TreeNode *root,int sum,vector<int> tmp)
	{
		if(root == NULL) return;
		tmp.push_back(root->data);
		if(root->left == NULL && root->right == NULL)
		{
			if(sum == root->data)
			{
				result.push_back(tmp);
			}
		}
		dfs(root->left,sum - root->data,tmp);
		dfs(root->right,sum - root->data,tmp);
	}

	vector<vector<int>> pathSum(TreeNode *root,int sum)
	{
		result.clear();
		if(root == NULL)
			return result;
		vector<int> tmp;
		dfs(root,sum,tmp);
		return result;
	}
};

//创建一个二叉树  
void buildTree2(TreeNode **T)  
{  
    int ch;  
    cin>>ch;  
    if(ch == 0)  
    {  
        *T = NULL;  
    }  
    else  
    {  
        *T = new TreeNode(ch);  
        printf("请输入%d的左孩子：",ch);  
        buildTree2(&((*T)->left));  
        printf("请输入%d的右孩子：",ch);  
        buildTree2(&((*T)->right));  
    }  
} 

void main()
{
	TreeNode *root;
	buildTree2(&root);
	solution *sol = new solution;
	vector<vector<int>> result = sol->pathSum(root,8);
	for(int i=0;i<result.size();i++)
	{
		for(int j=0;j<result[i].size();j++)
		{
			printf("%d ",result[i][j]);
		}
		printf("\n");
	}
	delete sol;
}