树结构练习——排序二叉树的中序遍历

来源：互联网发布：midi电脑音乐制作软件编辑：程序博客网时间：2024/06/03 18:41

#include <stdio.h>#include <stdlib.h>#include <string.h>int s1[1100];int k;typedef int element;typedef struct BiTnNode{    element data;    BiTnNode *lchild ,*rchild;} BiTnNode, *BiTree;void CreateTree(BiTree &T,int key){    if(T==NULL)    {        T=new BiTnNode;        T->lchild=T->rchild=NULL;        T->data=key;        return ;    }    else    {        if(key < T->data)            CreateTree(T->lchild,key);        else            CreateTree(T->rchild,key);    }}void inOrder(BiTree T){    if(T!=NULL)    {        inOrder(T->lchild);        s1[k++]=T->data;        inOrder(T->rchild);    }}int main(){    int n,m,i;    BiTree T;    while(~scanf("%d",&n))    {        T=NULL;        for(i=0; i<n; i++)        {            scanf("%d",&m);            CreateTree(T,m);        }        k=0;        inOrder(T);        s1[k]='\0';        for(i=0; i<n-1; i++)            printf("%d ",s1[i]);        printf("%d\n",s1[n-1]);    }    return 0;}

没必要多说；自己看底下的链接

[2482]二叉排序树

0 0