二插树递归算法实例
#include <stdio.h>
#include <stdlib.h>
typedef struct Node
{
char data;
struct Node *LChild;
struct Node *RChild;
}BiTNode,*BiTree;
void CreateBiTree(BiTree &bt)
{
char ch;
ch=getchar();
//printf("yes1!");
if (ch == ' ')
{
bt=NULL;
}
else
{
bt=(BiTNode *)malloc(sizeof(BiTNode));
bt->data=ch;
CreateBiTree(bt->LChild);
CreateBiTree(bt->RChild);
}
}
void Visit(char data_value)
{
printf("%c",data_value);
}
void PreOrder(BiTree root)
{
if (root != NULL)
{
Visit(root->data);
PreOrder(root->LChild);