/******************************************** ******先序遍历的递归算法,边访问边复制。********* *********************************************/ void copyBTree(BTree *bt,BTree *newbt) { if(bt != NULL) { newbt = (BTNode*)malloc(sizeof(BTNode)); newbt->data = bt->data; copyBTree(bt->lchild, newbt->lchild); copyBTree(bt->rchild, newbt->rchild); } else newbt = NULL; }