template//实现用层次非递归创建Node*BinaryTree::CreatBinaryTree(Node*&tr;){Node*temp;NodeQueuequeue(20);Tdata;coutdata;if(data!='#'){Node*temp1=newNode;temp1->Data=data;temp=t