二叉排序樹查詢，插入，刪除

dongyu2013發表於2014-04-11
排序

點選(此處)摺疊或開啟

  1. typedef struct BiTNode
  2. {
  3.     int data;
  4.     struct BiTNode *lchild, *rchild;
  5. }BiTNode, *BiTree;

  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. }

  33. //當二叉樹排序樹T中不存在關鍵字等於key的資料元素時
  34. //插入key並返回TRUE, 否則返回FALSE

  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. }


  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. }


  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/，如需轉載，請註明出處，否則將追究法律責任。

相關文章