printpath(a)
{
int path[MaxLength]
printpathrec(a, path, 0)
}
printpathrec(a, path, pathlen)
{
if(!a)
{
for i 1 to pathlen
print path[i]
}
path[pathlen] = a->num
printpathrec(a->left, path, pathlen+1)
printpathrec(a->right, path, pathlen+1)
}
No comments:
Post a Comment