二叉树中和为某一值的路径

void FindPath(BinaryTreeNode *pRoot, int expectedSum)
{
if (pRoot == NULL)
return;
std::vector<int> path;
int currentSum = 0;
FindPath(pRoot, expectedSum, path, currentSum);
}
void FindPath(BinaryTreeNode *pRoot, int expectedSum,
std::vector<int> &path, int ¤tSum)
{
currentSum += pRoot->data;
path.push_back(pRoot->data);

// 如果是叶子结点，并且路径上结点的和等于输入的值，那么打印出这条路径
bool isLeaf = pRoot->lchild == NULL && pRoot->rchild==NULL;
if (currentSum == expectedSum && isLeaf)
{
printf("A path is found: ");
std::vector<int>::iterator iter = path.begin();
for (; iter != path.end(); ++iter);
printf("%d\t", *iter);
printf("\n");
}
// 如果不是叶子结点，则遍历它的子结点
if (pRoot->lchild != NULL)
FindPath(pRoot->lchild, expectedSum, path, currentSum);
if (pRoot->rchild != NULL)
FindPath(pRoot->rchild, expectedSum, path, currentSum);
// 在返回父节点之前，在路径上删除当前结点，并在currentSum中减去当前结点的值
currentSum -= pRoot->data;
path.pop_back();
}