weixin_43729137的博客

#include<iostream.h> #include<stdlib.h> #define OK 1 #define ERROR 0 #define OVERFLOW -2 #define TRUE 1 #define FLASE 0 typedef int Status; typedef int ElemType; typedef char TElemType; typedef struct BiTNode //结点定义，二叉树的链表存储表示

#include<iostream> #include<stdlib.h> using namespace std; typedef int ElemType; typedef int Status; #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define OVERFLOW 0 typedef struct LNode{ ElemType date; struct LNode *next; }LN