数据结构b类红黑二叉树.doc

#includestdio.h #includemalloc.h #includestring.h #includewindows.h #include stdlib.h #define TRUE 1 #define BOOL int #define FALSE 0 #define Status int enum color_t { RED,BlACK }; typedef struct RedBlackNode //红黑二叉树结构体 { int data; char phone[12]; char name[12]; //数据域 color_t color; //颜色 RedBlackNode *left; //左孩子 RedBlackNode *right; //右孩子 RedBlackNode *parent; //父亲节点 }RedBlackNode,*RBTree; typedef struct LinkStack { RedBlackNode *rbtree; struct LinkStack *next; }LinkStack; LinkStack * InitStack(); Status StackEmpty(LinkStack *L); Status DestroyStack(LinkStack *L); Status StackLength(LinkStack *L); Status PushStack(LinkStack *L,RedBlackNode *r); RedBlackNode * PopStack(LinkStack *L); RedBlackNode *RBserach(RedBlackNode *rbtree,int key); RedBlackNode *RBMinimum(RBTree *T); RedBlackNode *RBMaximum(RBTree *T); RedBlackNode *RBpioneer(RedBlackNode *T); RedBlackNode *RBsucceed(RedBlackNode *T); void left_rotate(RBTree *rbtree,RedBlackNode *T); void right_rotate(RBTree *retree,RedBlackNode *T); BOOL RBInsertNode(RBTree *T,int data); int RBDeleteNode(RBTree *T, int data); void RbTreeInsertAdjust(RBTree *T,RedBlackNode *p); void RbTreeDeleteAdjust(RBTree *T,RedBlackNode *parent,RedBlackNode *x); void Output(RedBlackNode *p); void PreorderTraverse(RedBlackNode *T); void InorderTraverse(RedBlackNode *T); void PostorderTraverse(RedBlackNode *T); int prerecursion(RedBlackNode *T); int inrecursion(RedBlackNode *T); int postrecursion(RedBlackNode *T); void menu1(); void menu2(); void logon(); LinkStack * InitStack() { LinkStack *L; L=(LinkStack *)malloc(sizeof(LinkStack)); L-next=NULL; return L; } Status StackEmpty(LinkStack *L) { if(L-next) { return FALSE; } else { return TRUE; } } Status DestroyStack(LinkStack *L) { LinkStack *p,*r,*q; p=L-next; r=L; if(p==NULL) { return FALSE; } while(p!=N