二叉排序树(C语言).docVIP

#includestdio.h #includemalloc.h typedef int KeyType; typedef struct BinSearchNode { KeyType key; /* 结点的关键码字段*/ struct BinSearchNode * llink, * rlink;/* 二叉树的左、右指针*/ }DicElement; typedef struct { int MAXNUM; /*字典中元素的个数上界*/ int n; /*为字典中实际元素的个数*/ int *element; /*存放字典中的元素*/ } SeqDictionary; struct BinSearchNode; typedef struct BinSearchNode * PBinSearchNode; typedef struct BinSearchNode * BinSearchTree;/*二叉排序树*/ typedef BinSearchTree * PBinSearchTree; int search(PBinSearchTree ptree, KeyType key, PBinSearchNode*position) { PBinSearchNode p , q; p = *ptree; q = p; while (p != NULL) { q = p; /* 用q记录父结点的位置*/ if (p-key == key) { *position = p; return 1; } /* 检索成功*/ else if (p-key key) p = p-llink; /* 进入左子树继续检索*/ else p = p-rlink; /* 进入右子树继续检索*/ } *position = q; return 0; /* 检索失败，position指向失败时的父结点*/ } void inOrder(BinSearchNode *p) { if (p) { if (p-llink) inOrder(p-llink); printf(%d , p-key); if (p-rlink) inOrder(p-rlink); } } int insert(PBinSearchTree ptree, KeyType key) { PBinSearchNode p, position; if (search(ptree, key, position) == 1) return 1; /* 已存在关键码为key的结点 */ p = (PBinSearchNode)malloc(sizeof(struct BinSearchNode)); /* 申请新结点 */ if (p == NULL) { printf(Error\n); return 0; } /* 申请空间出错 */ p-key = key; p-llink = p-rlink = NULL; /* 对新结点的赋值*/ if (position == NULL) *ptree = p; /* 原树为空树 */ else if (key position-key) position-llink = p; /* 插入position的左子树 */ else position-rlink = p; /* 插入position的右子树*/ return 1; } int creatSearchTree(PBinSearchTree ptree, SeqDictionary *dic)//新建二叉排序树 { int i; *ptree = NULL; /* 将二叉排序树置空 */ printf(请输入字典中允许的最大元素个数\n); scanf(%d, dic-MAXNUM); dic-element = (int*)malloc(sizeof(int)); printf(请输入当前要插入的元素的个数\n); scanf(%d, dic-n); printf(请输入%d个大小不一样的整数\n,dic-n); for (i = 0; i dic-n; i++) { scanf(%d, dic-element[i]); if (!insert(ptree, dic-element[i])) return 0; /* 将新结点插入树中 */ } return 1; } int deleteNode_a(PBinSearchTree ptree, KeyType key) { PBinSearchNo