- 博客(0)
- 资源 (1)
- 收藏
- 关注
RSS订阅前中后序遍历二叉树
简单的前、中、后序遍历二叉树
部分代码:#include<stdio.h>
#include<malloc.h>
int Pos=0;
typedef struct node
{
char data;
struct node * lchild;
struct node * rchild;
}BTNode;
BTNode* CreateTreePre(char str[])
{
char tmp;
BTNode *newnode=NULL;
tmp = str[Pos++];
if( tmp!= '#')
{
newnode = (BTNode *)malloc(sizeof(BTNode));
newnode ->data = tmp;
newnode ->lchild = CreateTreePre (str);
newnode ->rchild = CreateTreePre (str);
}
return newnode;
}
void PreOrder(BTNode *b) //先序
{
if (b!=NULL)
{
printf("%c",b->data);
PreOrder(b->lchild);
PreOrder(b->rchild);
}
}
2019-04-14
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人