二叉树的三种排序算法

#include "stdafx.h"
#include <iostream>
using namespace std;


typedef struct _Node{
char ch;
struct _Node * lchild;
struct _Node * rchild;
}_Node,*_Tree;


//二叉树建树
void BuildTree(_Tree T, _Tree p)
{
if (p->ch <= T->ch){
if (T->lchild == NULL){
T->lchild = p;
}else{
BuildTree(T->lchild, p);
}
}
if (p->ch > T->ch){
if (T->rchild == NULL){
T->rchild = p;
}else{
BuildTree(T->rchild, p);
}
}
}


//先序排列
void FirstOrder(_Tree t)
{
if (t){
printf("%c",t->ch);
FirstOrder(t->lchild);
FirstOrder(t->rchild);
}
}


//中序排列
void MidOrder(_Tree t)
{
if (t){
MidOrder(t->lchild);
printf("%c", t->ch);
MidOrder(t->rchild);
}
}


//后序排列
void LastOrder(_Tree t)
{
if (t){
LastOrder(t->lchild);
LastOrder(t->rchild);
printf("%c",t->ch);
}
}


void DeleteTree(_Tree t)
{
if (t)
{
DeleteTree(t->lchild);
DeleteTree(t->rchild);
if (t != NULL)
{
delete t;
}
}
}
int _tmain(int argc, _TCHAR* argv[])
{
char ch;
_Node *T = NULL;
printf("请输入需要排序的字符，并以空格键结束输入，以回车键继续！\n");
scanf("%c",&ch);


//对输入的字符进行建树
while(ch != ' '){
_Node *p = new _Node;
p->ch = ch;
p->lchild = NULL;
p->rchild = NULL;
  
if (T == NULL){
T = p;
}else{
BuildTree(T, p);
}
scanf("%c", &ch);
}


//按照先序排列
printf("先序排列的结果:");
FirstOrder(T);
printf("\n");
//按照中序排列
printf("中序排列的结果:");
MidOrder(T);
printf("\n");
//按照后序排列
printf("后序排列的结果:");
LastOrder(T);
printf("\n");


//销毁对象
DeleteTree(T);
return 0;
}

测试结果如下：