今天瞄到树递归遍历,就多瞄了两眼,没想到一瞄瞄出了自己的尴尬!
直接看代码:
#include<stdio.h>
#include<string.h>
typedef struct BiTNode
{
int data;
BiTNode *lChild, *rChild;
}BiTNode;
typedef struct BiTNode* BiTree;
void inOrder(BiTree tree)
{
if (tree == NULL)
{
return;
}
if (tree->lChild != NULL)
{
inOrder(tree->lChild);
}
printf("%d", tree->data);
if (tree->rChild != NULL)
{
inOrder(tree->rChild);
}
}
void main()
{
BiTNode nodeA, nodeB, nodeC, nodeD, nodeE;
memset(&nodeA, 0, sizeof(BiTNode));
memset(&nodeB, 0, sizeof(BiTNode));
memset(&nodeC, 0, sizeof(BiTNode));
memset(&nodeD, 0, sizeof(BiTNode));
memset(&nodeE, 0, sizeof(BiTNode));
nodeA.data = 1;
nodeB.data = 2;
nodeC.data = 3;
nodeD.data = 4;
nodeE.data = 5;
nodeA.lChild = &