从根节点到叶子节点经过的所有节点为一个路径.
//path 用于保存路径
void findPath(BinaryTreeNode * root, int target, int n, int path[])
{if(!root)
return ;
target -= root->m_nValues;
path[n++] = root->m_nValues;
if(target == 0)
{
showPath(path, n);
}
findPath(root->m_pLeft, target, n, path);
findPath(root->m_pRight, target, n, path);
}