摘要： 首先看如下代码：void creatBtree(Node* head) //按前序生成树。{ head=new Node(); Node* p=head; int t; scanf("%d",&t); if(t==-1)return; else p->data=t; creatBtree(p->left); creatBtree(p->right); printf("%在函数里，head的地址为%d\n",head); return;}int main(){ Head *head; freopen("tree.txt& 阅读全文