二叉树的递归、非递归的先序、中序、后序遍历以及层次遍历和求叶子节点数VIP免费

#include #include #include #define STACK_INT_SIZE 100 //存储空间初始分配量 #define STACKINCREMENT 10 //存储空间分配增量 #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 #define OVERFLOW -2 typedef char TElemType; typedef int Status; typedef char SElemType; //二叉树的二叉链表存储表示 typedef struct BiTNode { TElemType data; struct BiTNode *lchild, *rchild; // 左右孩子指针 }BiTNode, *BiTree; //用于存储二叉树结点的栈 typedef struct { BiTree *base; BiTree *top; int stacksize; //当前已分配的存储空间 }SqStack; //定义链式队列结点 typedef struct QNode { BiTree Queuedata; struct QNode * next; }QNode,* QueuePtr; //定义链式队列 typedef struct { QueuePtr front; // QueuePtr rear; }LinkQueue; //创建存储二叉树结点的空栈 Status InitStack(SqStack &S) { S

base = (BiTree *) malloc(sizeof(BiTree)); if(

base) exit(OVERFLOW); S

top = S

base; S

stacksize = STACK_INT_SIZE; return