[笔试面试][code_by_hand]从二元树中找出和为某一值的所有路径

View Code 
 #include <iostream>
 #include <vector>
 using namespace std;
 
 
 struct BinaryTreeNode
 {
         int m_nValue;
         BinaryTreeNode * m_pLeft;
         BinaryTreeNode * m_pRight;
 };
 
 
 void print(vector<int> & v)
 {
         for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
         {
                 cout<<*it<<" ";
         }
         cout<<endl;
 }
 
 
 void travel(BinaryTreeNode * root, vector<int> &v, int total, int &current)
 {
    if(root==NULL)
    {
        return;
    }
         v.push_back(root->m_nValue);
         current += root->m_nValue;
 
 
         if (current == total)
         {
                 print(v);
         }
 
 
         if (root->m_pLeft != NULL)
         {
                 travel(root->m_pLeft, v, total, current);
         }
         if (root->m_pRight != NULL)
         {
                 travel(root->m_pRight, v, total, current);
         }
 
 
         v.pop_back();
         current -= root->m_nValue;
 }
 
 
 BinaryTreeNode * buildnode(int num = 0, BinaryTreeNode * left = NULL, BinaryTreeNode * right = NULL)
 {
         BinaryTreeNode * res = new BinaryTreeNode();
         res->m_nValue = num;
         res->m_pLeft = left;
         res->m_pRight = right;
         return res;
 }
 
 
 int main()
 {
         BinaryTreeNode * root = buildnode(10, buildnode(5, buildnode(4), buildnode(7, buildnode(3, NULL, buildnode(-3)))), buildnode(12));
         vector<int> v;
         int total = 22;
         int current = 0;
         travel(root, v, total, current);
         return 0;
 }