刪除二進制搜索樹中的節點C

Question

我想從二叉搜索樹中刪除節點。在這個功能中有3個參數。其中之一是樹，其他是開始節點和結束節點。我想刪除開始節點和結束節點之間的節點。 P.S：用戶寫入起始節點和結束節點，我們將它們用作參數。

這是我寫的代碼：

node * removeReviewsBetween(node * tree,double start,double end){ 
    node * newNode; 
    if(tree==NULL){ 
     return NULL; 
    } 


    if(start< tree->scoreNumber){ 
     tree->left=removeReviewsBetween(tree->left,start,end); 
    } 

    else if(start > tree->scoreNumber){ 
     tree->right=removeReviewsBetween(tree->right,start,end); 
    } 

    else{ 
     if(tree->right && tree->left){ 
      newNode=findMin(tree->right); 
      tree->scoreNumber=newNode->scoreNumber; 
      tree->right=removeReviewsBetween(tree->left,tree->scoreNumber,end); 
     } 

     else{ 
      newNode=tree; 
      if(tree->left==NULL){ 
       tree=tree->right; 
      } 
      else if(tree->right==NULL){ 
       tree=tree->left; 
      } 
      free(newNode); 
     } 

     return tree; 
    } 
} 

我寫成才，但它正確好好嘗試的工作。請給我一些建議

Answer 1

應該這樣做 - 你的代碼稍加修改：

node *removeReviewsBetween(node *tree, double start, double end){ 
    node *newNode; 
    double score; 

    if(tree==NULL){ 
     return NULL; 
    } 

    while (tree->scoreNumber >= start && tree->scoreNumber =< end){ // if head is in the range to delete 
     if(tree->right){ 
      newNode = findMin(tree->right); 
      score = newNode->scoreNumber; 
      removeReviewsBetween(tree, score, score); 
      tree->scoreNumber = score; 
      continue; 
     } 

     if(tree->left){ 
      newNode = findMax(tree->left); 
      score = newNode->scoreNumber; 
      removeReviewsBetween(tree, score, score); 
      tree->scoreNumber = score; 
      continue; 
     } 

     return NULL; // if the only node left is the head and it's still in the range to delete 
    } 

    if(end < tree->scoreNumber){ // if all nodes to delete are in the left subtree 
     tree->left = removeReviewsBetween(tree->left, start, end); 
     return tree; 
    } 

    else if(start > tree->scoreNumber){ // if all nodes to delete are in the right subtree 
     tree->right = removeReviewsBetween(tree->right, start, end); 
     return tree; 
    }   
}