深入探究二叉树（c）--（2)

文件tree.c

//tree.c xiaolai 2011-5-13#include <string.h>#include <stdio.h>#include <stdlib.h>#include "Tree.h"typedef struct pair {Node * parent;Node * child;} Pair;static Node * MakeNode( const Item * pi);static bool ToLeft(const Item *i1,const Item *i2);static bool ToRight(const Item *i1,const Item *i2);static void AddNode(Node * new_node ,Node * root);static void InOrder(const Node * root,void (*pfun)(Item item));static Pair SeekItem(const Item * pi,const Tree * ptree);static void DeleteNode(Node ** ptr);static void DeleteAllNodes(Node * ptr);void InitializeTree(Tree * ptree){ptree->root = 0;ptree->size = 0;}bool TreeIsEmpty(const Tree * ptree){if(ptree->root == NULL)return true;else false;}bool TreeIsFull(const Tree * ptree){if(ptree->size == MAXITEM)return true;else return false;}int TreeItemCount(const Tree * ptree){return ptree->size;}bool AddItem(const Item * pi,Tree * ptree){Node * new_node ;if(TreeIsFull(ptree)){fprintf(stderr,"tree is full/n");return false ;}if(SeekItem(pi,ptree).child != NULL){fprintf(stderr,"Attempted to add duplicate item/n");return false ;}new_node = MakeNode(pi);//point to new point if(new_node == NULL){fprintf(stderr,"Couldn't create node /n");return false ;} // 成功创建新的节点了ptree->size++;if(ptree->root == NULL)ptree->root = new_node;else AddNode (new_node,ptree->root);return true;}bool InTree(const Item * pi,const Tree * ptree){return (SeekItem(pi,ptree).child == NULL) ? false : true;} //查看某个item是否在树 zhong bool DeleteItem (const Item * pi,Tree * ptree){Pair look;look = SeekItem(pi,ptree);if(look.child ==NULL)return false ;if(look.parent == NULL)DeleteNode (&ptree->root);else if(look.parent->left ==look.child)DeleteNode(&look.parent->left);else DeleteNode(&look.parent->right);ptree->size--;return true;} //从树中查找某个元素，删掉void Traverse (const Tree * ptree ,void (* pfun)(Item item)){if(ptree != NULL)InOrder(ptree->root,pfun);}void DeleteAll(Tree * ptree){if(ptree != NULL)DeleteAllNodes(ptree->root);ptree->root = NULL;ptree->size = 0;}static void InOrder(const Node * root ,void (* pfun)(Item item)){if(root != NULL){InOrder(root->left,pfun);(*pfun)(root->item);InOrder(root->right,pfun);}}static void DeleteAllNodes(Node * root){Node * pright;if(root != NULL){pright = root->right;DeleteAllNodes(root->left);free(root);DeleteAllNodes(pright);}}static void AddNode(Node * new_node,Node * root){//查找新空节点 ，插入 puts("add a note");if(ToLeft(&new_node->item, &root->item)){if(root->left == NULL)root->left = new_node;else AddNode(new_node,root->right);}else if(ToRight(&new_node->item,&root->item)){if(root->right == NULL)root->right = new_node ;else AddNode(new_node,root->right);}else {fprintf(stderr ,"location error in AddNode ()/n");exit(1);}puts("add a note");}static bool ToLeft (const Item * i1,const Item * i2){int comp1;if((comp1 = strcmp(i1->petname,i2->petname)) < 0) return true;else if(comp1 == 0 && strcmp(i1->petkind,i2->petkind) < 0 ) //如果小于中间数值return true;else return false ;}static bool ToRight (const Item * i1,const Item * i2){int comp1;if((comp1 = strcmp(i1->petname,i2->petname)) > 0)return true;elseif(comp1 == 0 && strcmp(i1->petkind,i2->petkind) > 0 ) // 大于中间的数值... return true; else return false ;}static Node * MakeNode (const Item * pi ){Node * new_node ;if((new_node = (Node * )malloc (sizeof(Node))) != NULL)puts("MakeNode");if(new_node != NULL){new_node->item = *pi;new_node->left = NULL;new_node->right = NULL;puts("makenode a new ");}return new_node;}static Pair SeekItem(const Item *pi ,const Tree *ptree){Pair look;look.parent = NULL;look.child = ptree->root;if(look.child ==NULL)return look;while(look.child != NULL){if(ToLeft(pi,&(look.child->item))){look.parent = look.child ;printf("i%p/n",look.parent);look.child= look.child->left;}elseif(ToRight(pi,&(look.child->item))){look.parent =look.child; printf("i%p/n",look.parent);look.child = look.child->right;}else{puts("the same to the middle value");break;}}return look;}static void DeleteNode(Node **ptr){Node * temp;puts((*ptr)->item.petname);if((*ptr)->left == NULL){temp = *ptr;*ptr = (*ptr)->right;free(temp);}else if((*ptr)->right == NULL){temp = *ptr;*ptr = (*ptr)->left;free(temp);}else {for (temp = (*ptr)->left;temp->right != NULL;temp = temp->right)continue;temp->right = (*ptr)->right;temp = *ptr;free(temp);}} 

 

以下是main.c

 

#include <stdio.h>#include <string.h>#include <ctype.h>#include "Tree.h"void AddPerson( Tree *pt){Item temp;if(TreeIsFull(pt))puts("person is full!");else {puts("please enter name");gets(temp.petname);puts("please enter kind");gets(temp.petkind);AddItem(&temp,pt);}}void printitem(Item item){ printf("person name %-19s kind :%-19s/n",item.petname,item.petkind); }void showperson(const Tree * pt){Traverse(pt,printitem);}void findperson(const Tree * pt){Item temp;puts("name you want to find :");gets(temp.petname);puts("pet kind you want to find :");gets(temp.petkind);if(InTree(&temp,pt)) {printf("is a menber /n");}else printf("is not a number /n");}void delete_item (Tree * pt){Item temp;puts("enter name: you want to delete ");gets(temp.petname);puts("enter kind : you want to delete ");gets(temp.petkind);if(DeleteItem(&temp,pt))printf("is dropped from the club./n");else printf("is not a menber ,so can't delete /n");}void clear(Tree * pt){ DeleteAll(pt);}int main(){Tree person;InitializeTree(&person);int i ;for(i = 0 ;i< 3;i++){AddPerson(&person);}printf("Item count :%d/n",TreeItemCount(&person));showperson(&person);findperson(&person);delete_item(&person);showperson(&person);clear(&person);showperson(&person);printf("Item count :%d/n",TreeItemCount(&person));return 0;}