在二元树中找出何为某一值的所有路径 【微软面试100题 第四题】

#include <iostream>
#include <queue>

using namespace std;

typedef struct BinaryTreeNode
{
BinaryTreeNode *left,*right;
int data;
}BinaryTreeNode;

void findPath(BinaryTreeNode *pRoot,int expectedSum);
void initTree(BinaryTreeNode **p);
int main(void)
{
BinaryTreeNode *pRoot = NULL;

initTree(&pRoot);
findPath(pRoot,22);

return 0;
}
void findPath(BinaryTreeNode *pRoot,int expectedSum,deque<int> &path,int currentSum);
void findPath(BinaryTreeNode *pRoot,int expectedSum)
{
if(pRoot == NULL)
return ;

deque<int> path;
int currentSum = 0;
findPath(pRoot,expectedSum,path,currentSum);
}
//--------------------核心代码----------------------------------
void findPath(BinaryTreeNode *pRoot,int expectedSum,deque<int> &path,int currentSum)
{
currentSum += pRoot->data;
path.push_back(pRoot->data);

bool isLeaf = pRoot->left==NULL && pRoot->right==NULL;
if(isLeaf && currentSum==expectedSum)
{
cout << "A path is found:";
deque<int>::iterator iter = path.begin();
for(;iter != path.end();iter++)
{
cout << *iter;
if(iter+1 != path.end())
cout << "-->";
}
cout << endl;
}

if(pRoot->left != NULL)
findPath(pRoot->left,expectedSum,path,currentSum);
if(pRoot->right != NULL)
findPath(pRoot->right,expectedSum,path,currentSum);

path.pop_back();
}
//      10
//     / \
//    5   12
//   / \
//  4   7
void initTree(BinaryTreeNode **p)
{
*p = new BinaryTreeNode;
(*p)->data = 10;

BinaryTreeNode *tmpNode = new BinaryTreeNode;
tmpNode->data = 5;
(*p)->left = tmpNode;

tmpNode = new BinaryTreeNode;
tmpNode->data = 12;
(*p)->right = tmpNode;
tmpNode->left = NULL;
tmpNode->right = NULL;

BinaryTreeNode *currentNode = (*p)->left;

tmpNode = new BinaryTreeNode;
tmpNode->data = 4;
currentNode->left = tmpNode;
tmpNode->left = NULL;
tmpNode->right = NULL;

tmpNode = new BinaryTreeNode;
tmpNode->data = 7;
currentNode->right = tmpNode;
tmpNode->left = NULL;
tmpNode->right = NULL;

}