打印二叉树中所有和为某一值的路径

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

struct BiTreeNode{
int val;
BiTreeNode* leftChild;
BiTreeNode* rightChild;
};

void FindPathMatchSum(BiTreeNode* root,
int expectedSum,
int& currentSum,
vector<int>& path)
{
currentSum += root->val;
path.push_back(root->val);

if (root->leftChild == NULL && root->rightChild == NULL){
if (expectedSum == currentSum){
//print path
for (int i = 0; i < path.size(); ++i)
printf("%d ", path[i]);
}
return;
}

if (root->leftChild)
FindPathMatchSum(root->leftChild, expectedSum, currentSum, path);
if (root->rightChild)
FindPathMatchSum(root->rightChild, expectedSum, currentSum, path);
currentSum -= root->val;
path.pop_back();
}

void FindPath(BiTreeNode* root, int expectedSum){
if (root == NULL) return;
vector<int> path;
int currentSum = 0;
FindPathMatchSum(root, expectedSum, currentSum, path);
}