二叉排序树查找，插入，删除

点击(此处)折叠或打开

1. typedef struct BiTNode
   
2. {
   
3.     int data;
   
4.     struct BiTNode *lchild, *rchild;
   
5. }BiTNode, *BiTree;
   
6. 
   
7. //递归查找二叉排序树T中是否存在key
   
8. //指针f指向T的双亲，其初始化调用值为NULL
   
9. //若查找成功，则指针p指向该数据元素节点，并返回TURE
   
10. //否则指针p指向查找路径上访问的最后一个节点并返回FALSE
    
11. bool SearchBST(BiTree T, int key, BiTree f, BiTree *p)
    
12. {
    
13.     if(!T)
    
14.     {
    
15.         *p=f;
    
16.         return FALSE;
    
17.     }
    
18.     else if(key==T->data)
    
19.     {
    
20.      *p=T;
    
21.         return TRUE;
    
22.     }
    
23.     else if(key<T->data)
    
24.     {
    
25.         return SearchBST(T->lchild, key, T, p);
    
26.     }
    
27.     else
    
28.     {
    
29.         return SearchBST(T->rchild, key, T, p);
    
30.     }
    
31. }
    
32. 
    
33. //当二叉树排序树T中不存在关键字等于key的数据元素时
    
34. //插入key并返回TRUE, 否则返回FALSE
    
35. 
    
36. bool InsertBST(BiTree *T, int key)
    
37. {
    
38.     BiTree p,s;
    
39.     if(!SearchBST(*T, key, NULL, &p))
    
40.     {
    
41.         s=(BiTree)malloc(sizeof(BiTNode));
    
42.         s->data=key;
    
43.         s->lchild=s->rchild=NULL;
    
44.         if(!p)
    
45.         {
    
46.             *T=s;
    
47.         }
    
48.         else if(key<p->data)
    
49.         {
    
50.             p->lchild=s;
    
51.         }
    
52.         else
    
53.         {
    
54.             p->rchild=s;
    
55.         }
    
56.         return true;
    
57.     }
    
58.     else
    
59.     {
    
60.         return false;
    
61.     }
    
62. }
    
63. 
    
64. 
    
65. bool Delete(BiTree *p)
    
66. {
    
67.     BiTree q,s;
    
68.     if( (*p)->rchild==NULL )
    
69.     {
    
70.         q=*p; *p=(*p)->lchild; free(q);
    
71.     }
    
72.     else if( (*p)->lchild==NULL )
    
73.     {
    
74.         q=*p; *p=(*p)->rchild; free(q);
    
75.     }
    
76.     else
    
77.     {
    
78.         q=*p; s=(*p)->lchild;
    
79.         while(s->rchild)
    
80.         {
    
81.             q=s; s=s->rchild;
    
82.         }
    
83.         (*p)->data=s->data;
    
84.         if(q!=*p)
    
85.             q->rchild=s->lchild;
    
86.         else
    
87.             q->lchild=s->rchild;
    
88.     }
    
89.     return true;
    
90. }
    
91. 
    
92. 
    
93. bool DeleteBST(BiTree *T, int key)
    
94. {
    
95.     if(!*T)
    
96.     {
    
97.         return false;
    
98.     }
    
99.     else
    
100.     {
     
101.         if(key==(*T)->data)
     
102.         {
     
103.             return Delete(T);
     
104.         }
     
105.         else if (key<(*T)->data)
     
106.         {
     
107.             return DeleteBST(&(*T)->lchild, key);
     
108.         }
     
109.         else
     
110.         {
     
111.             return DeleteBST(&(*T)->rchild, key);
     
112.         }
     
113.     }
     
114. }

来自 “ ITPUB博客 ” ，链接：http://blog.itpub.net/29012686/viewspace-1140292/，如需转载，请注明出处，否则将追究法律责任。

转载于:http://blog.itpub.net/29012686/viewspace-1140292/