cengci.cpp

数据结构的一些简单编程题,二叉树结构

#include<stdio.h>
#include<malloc.h>
#include <stdlib.h>
#include <string.h>
#define MAXSIZE 100
#define Maxlen  20
struct bitnode{
  char data;
  struct bitnode *lchild,*rchild;
}*bitnode;

 void createbitree(struct bitnode * &t){
  char ch;
  scanf("%c",&ch);
  if(ch=='0') t=NULL;
  else{
     t=(struct bitnode*)malloc(sizeof(bitnode));
     t->data=ch;
     createbitree(t->lchild);
     createbitree(t->rchild);
 }
}

void level(struct bitnode * &T) {

	struct node{
	  struct bitnode * tt[Maxlen];
	  int fdata,rdata;
	}q;
    q.fdata=0;
	q.rdata=0;
	if(T != NULL)  printf("%c ",T->data); 
    
	q.tt[q.fdata]=T;
	q.rdata=q.rdata+1;
	while(q.fdata < q.rdata)
	{
	  T=q.tt[q.fdata];
	  q.fdata = q.fdata+1;
	  if(T->lchild != NULL)
	  {
	    printf("%c ",T->lchild->data);
		q.tt[q.rdata] = T->lchild;
		q.rdata =q.rdata+1;
	  }
	  if(T->rchild != NULL)
	  {
	    printf("%c ",T->rchild->data);
		q.tt[q.rdata] = T->rchild;
		q.rdata = q.rdata+1;
	  }
	}
printf("\n");}  //层次非递归遍历二叉树(9)
void main()
{

    struct bitnode *b;
	printf("请输入一个先序序列:");
    	createbitree(b);
    	level(b);
	
}