void bt_all_path(btree tree, item_type a[], int len) {
int i;
if (tree != NULL) {
if (tree->lchild == NULL && tree->rchild == NULL) {
printf("path for %c is:%c", tree->data, tree->data);
for (i = len - 1; i >= 0; i--) {
printf(" %c", a[i]);
}
printf("\n");
} else {
a[len] = tree->data;
len++;
bt_all_path(tree->lchild, a, len);
bt_all_path(tree->rchild, a, len);
len--;
}
}
}
int i;
if (tree != NULL) {
if (tree->lchild == NULL && tree->rchild == NULL) {
printf("path for %c is:%c", tree->data, tree->data);
for (i = len - 1; i >= 0; i--) {
printf(" %c", a[i]);
}
printf("\n");
} else {
a[len] = tree->data;
len++;
bt_all_path(tree->lchild, a, len);
bt_all_path(tree->rchild, a, len);
len--;
}
}
}
转载于:https://blog.51cto.com/wujuxiang/421971