数据结构之复制二叉树

#include <iostream> using namespace std; struct BitNode { char data; BitNode *lchild; BitNode *rchild; }; void create(BitNode *&T) { char ch; cin>>ch; if(ch=='#') T=NULL; else { T=new BitNode; T->data

>>阅读原文<<