tree_bi.cpp

来自「数据结构中所有算法的实现」· C++ 代码 · 共 35 行

#include "d:\cpp\head.h"
typedef char ElemType;
typedef struct BiTNode{
  ElemType data;
  struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
Status CreateBiTree(BiTree &T){
  char ch;
  scanf("%c",&ch);
  if(ch==' ') T=NULL;
  else{
    if(!(T=(BiTNode*)malloc(sizeof(BiTNode)))) exit(OVERFLOW);
    T->data=ch;
    CreateBiTree(T->lchild);
    CreateBiTree(T->rchild);
  }//if...else
  return OK;
}//CreateBiTree
void Visit(ElemType e){
  printf("%5c",e);
}//Visit
void PreOrderTraverse(BiTree T,void (*Visit)(ElemType e)){
  if(T){
    Visit(T->data);
    PreOrderTraverse(T->lchild,Visit);
    PreOrderTraverse(T->rchild,Visit);
  }
}//PreOrderTraverse

void main(){
  BiTree T;
  CreateBiTree(T);
  PreOrderTraverse(T,Visit);
}