树笔记

template
void bitree::preorder(binode *bt)//前序遍历
{
if(btNULL)return;
else
{
cout<data;
preorder(bt->lchild);
preorder(bt->rchild);
}
};
template
void bitree::inorder(binode *bt)//中序遍历
{
if(btNULL)return;
else
{
inorder(bt->lchild);
cout<data;
inorder(bt->rchild);
}
};
template
void bitree::postorder(binode *bt) //后序遍历
{
if(btNULL)return;
else
{
postorder(bt->lchild);
postorder(bt->rchild);
cout<data;
}
};
template
void bitree::leverorder() //层序遍历
{
binode *front,*rear,*q;
binode *Q[];
front=rear=-1;
if(rootNULL)return;
Q[++rear]=root;
while(front!=rear)
{
q=Q[++front];
cout<data;
if(q->lchild!=NULL)Q[++rear]=q->lchild;
if(q->rchild!=NULL)Q[++rear]=q->rchild;
}
};