根据已知先序遍历建立二叉树(带空结点)
Tree* buildtree_pre()
{
if(pre[cnt]==',')
{
cnt++;
return NULL;
}
Tree *root = new Tree;
root->data=pre[cnt++];
root->l=buildtree_pre();
root->r=buildtree_pre();
return root;
}
根据先序遍历和中序遍历建立二叉树
Tree* buildtree_pre_mid(int len,char pre[],char mid[])
{
if(!len)
return NULL;
Tree *root = new Tree;
root->data=pre[0];
int i;
for(i=0;i<len;i++)
{
if(mid[i]==pre[0])
break;
}
root->l=buildtree_pre_mid(i,pre+1,mid);
root->r=buildtree_pre_mid(len-i-1,pre+i+1,mid+i+1);
return root;
}
根据中序遍历和后序遍历建立二叉树
Tree* buildtree_mid_post(int len,char mid[],char post[])
{
if(!len)
return NULL;
Tree *root = new Tree;
root->data=post[len-1];
int i;
for(i=0;i<len;i++)
{
if(mid[i]==post[len-1])
break;
}
root->l=buildtree_mid_post(i,mid,post);
root->r=buildtree_mid_post(len-i-1,mid+i+1,post+i);
return root;
}
先序、中序、后序遍历
void pre_Travel(Tree *root)
{
if(root)
{
cout<<root->data;
pre_Travel(root->l);
pre_Travel(root->r);
}
}
void mid_Travel(Tree *root)
{
if(root)
{
mid_Travel(root->l);
cout<<root->data;
mid_Travel(root->r);
}
}
void post_Travel(Tree *root)
{
if(root)
{
post_Travel(root->l);
post_Travel(root->r);
cout<<root->data;
}
}
层序遍历
void Sequence_Travel(Tree *root)
{
queue<Tree *> t;
t.push(root);
while(!t.empty())
{
root=t.front();
t.pop();
if(root)
{
cout<<root->data;
t.push(root->l);
t.push(root->r);
}
}
}