找二叉树中路径和为某个值的路径

//============================================================================
// Name        : reversestring.cpp
// Author      : qxyu
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#include<stack>
#include<string>
#include<unordered_map>
//#include<uint32_t>
using namespace std;

/**
 * Definition for a point.
 */

struct Treenode{
    Treenode* left;
    Treenode* right;
    int val;
    Treenode(int x):left(NULL),right(NULL),val(x){}
};

void find_path(Treenode* root, int sum, vector<int>& v){

	if(root==NULL) return;
	sum-=root->val;
	v.push_back(root->val);
	if(sum==0&&root->left==NULL&&root->right==NULL) {
		for(int i = 0; i < v.size(); i ++)
			cout<<v[i]<<" ";
	}
	if(root->val<sum&&root->left){
		find_path(root->left,sum,v);
	}

	if(root->val<sum&&root->right){
			find_path(root->right,sum,v);
		}

	sum+=root->val;
	v.pop_back();
}


int main()
{
  vector<int> pre;
  Treenode* a=new Treenode(10);
      Treenode* b=new Treenode(5);
      Treenode* c=new Treenode(12);
      Treenode* d=new Treenode(4);
      Treenode* e=new Treenode(7);

      a->left=b;
      a->right=c;
      b->left=d;
      b->right=e;

 find_path(a,22,pre);

  return 0;

}