原贴地址: http://blog.csdn.net/feixiaoxing/article/details/6867997
【 声明:版权所有,欢迎转载,请勿用于商业用途。 联系信箱:feixiaoxing @163.com】
2.4 删除节点的左右子树都存在,此时又会分成两种情形
1)左节点是当前左子树的最大节点,此时只需要用左节点代替根节点即可
- /*
- *
- * 10 ======> 6
- * / \ / \
- * 6 15 5 15
- * /
- * 5
- */
- STATUS delete_node_from_tree(TREE_NODE** ppTreeNode, int data)
- {
- TREE_NODE* pTreeNode;
- TREE_NODE* pLeftMax;
- if(NULL == ppTreeNode || NULL == *ppTreeNode)
- return FALSE;
- pTreeNode = find_data_in_tree_node(*ppTreeNode, data);
- if(NULL == pTreeNode)
- return FALSE;
- if(*ppTreeNode == pTreeNode){
- if(NULL == pTreeNode->left_child && NULL == pTreeNode->right_child){
- *ppTreeNode = NULL;
- }else if(NULL != pTreeNode->left_child && NULL == pTreeNode->right_child){
- *ppTreeNode = pTreeNode->left_child;
- pTreeNode->left_child->parent = NULL;
- }else if(NULL == pTreeNode->left_child && NULL != pTreeNode->right_child){
- *ppTreeNode = pTreeNode->right_child;
- pTreeNode->right_child->parent = NULL;
- }else{
- pLeftMax = find_max_node(pTreeNode->left_child);
- if(pLeftMax == pTreeNode->left_child){
- *ppTreeNode = pTreeNode->left_child;
- (*ppTreeNode)->right_child = pTreeNode->right_child;
- (*ppTreeNode)->right_child->parent = *ppTreeNode;
- (*ppTreeNode)->parent = NULL;
- }
- }
- free(pTreeNode);
- return TRUE;
- }
- return TRUE;
- }
- static void test6()
- {
- TREE_NODE* pTreeNode = NULL;
- assert(TRUE == insert_node_into_tree(&pTreeNode, 10));
- assert(TRUE == insert_node_into_tree(&pTreeNode, 6));
- assert(TRUE == insert_node_into_tree(&pTreeNode, 5));
- assert(TRUE == insert_node_into_tree(&pTreeNode, 15));
- assert(TRUE == delete_node_from_tree(&pTreeNode, 10));
- assert(6 == pTreeNode->data);
- assert(NULL == pTreeNode->parent);
- assert(15 == pTreeNode->right_child->data);
- assert(pTreeNode = pTreeNode->right_child->parent);
- assert(NULL == pTreeNode->parent);
- free(pTreeNode->left_child);
- free(pTreeNode->right_child);
- free(pTreeNode);
- }
2)左节点不是当前左子树的最大节点,情形如下所示
- /*
- *
- * 10 ======> 8
- * / \ / \
- * 6 15 5 15
- * \
- * 8
- */
- STATUS delete_node_from_tree(TREE_NODE** ppTreeNode, int data)
- {
- TREE_NODE* pTreeNode;
- TREE_NODE* pLeftMax;
- if(NULL == ppTreeNode || NULL == *ppTreeNode)
- return FALSE;
- pTreeNode = find_data_in_tree_node(*ppTreeNode, data);
- if(NULL == pTreeNode)
- return FALSE;
- if(*ppTreeNode == pTreeNode){
- if(NULL == pTreeNode->left_child && NULL == pTreeNode->right_child){
- *ppTreeNode = NULL;
- }else if(NULL != pTreeNode->left_child && NULL == pTreeNode->right_child){
- *ppTreeNode = pTreeNode->left_child;
- pTreeNode->left_child->parent = NULL;
- }else if(NULL == pTreeNode->left_child && NULL != pTreeNode->right_child){
- *ppTreeNode = pTreeNode->right_child;
- pTreeNode->right_child->parent = NULL;
- }else{
- pLeftMax = find_max_node(pTreeNode->left_child);
- if(pLeftMax == pTreeNode->left_child){
- *ppTreeNode = pTreeNode->left_child;
- (*ppTreeNode)->right_child = pTreeNode->right_child;
- (*ppTreeNode)->right_child->parent = *ppTreeNode;
- (*ppTreeNode)->parent = NULL;
- }else{
- pTreeNode->data = pLeftMax->data;
- pLeftMax->parent->right_child = NULL;
- pTreeNode = pLeftMax;
- }
- }
- free(pTreeNode);
- return TRUE;
- }
- return TRUE;
- }
- static void test7()
- {
- TREE_NODE* pTreeNode = NULL;
- assert(TRUE == insert_node_into_tree(&pTreeNode, 10));
- assert(TRUE == insert_node_into_tree(&pTreeNode, 6));
- assert(TRUE == insert_node_into_tree(&pTreeNode, 8));
- assert(TRUE == insert_node_into_tree(&pTreeNode, 15));
- assert(TRUE == delete_node_from_tree(&pTreeNode, 10));
- assert(8 == pTreeNode->data);
- assert(NULL == pTreeNode->parent);
- assert(NULL == pTreeNode->left_child->right_child);
- assert(NULL == pTreeNode->parent);
- free(pTreeNode->left_child);
- free(pTreeNode->right_child);
- free(pTreeNode);
- }
- STATUS delete_node_from_tree(TREE_NODE** ppTreeNode, int data)
- {
- TREE_NODE* pTreeNode;
- TREE_NODE* pLeftMax;
- if(NULL == ppTreeNode || NULL == *ppTreeNode)
- return FALSE;
- pTreeNode = find_data_in_tree_node(*ppTreeNode, data);
- if(NULL == pTreeNode)
- return FALSE;
- if(*ppTreeNode == pTreeNode){
- if(NULL == pTreeNode->left_child && NULL == pTreeNode->right_child){
- *ppTreeNode = NULL;
- }else if(NULL != pTreeNode->left_child && NULL == pTreeNode->right_child){
- *ppTreeNode = pTreeNode->left_child;
- pTreeNode->left_child->parent = NULL;
- }else if(NULL == pTreeNode->left_child && NULL != pTreeNode->right_child){
- *ppTreeNode = pTreeNode->right_child;
- pTreeNode->right_child->parent = NULL;
- }else{
- pLeftMax = find_max_node(pTreeNode->left_child);
- if(pLeftMax == pTreeNode->left_child){
- *ppTreeNode = pTreeNode->left_child;
- (*ppTreeNode)->right_child = pTreeNode->right_child;
- (*ppTreeNode)->right_child->parent = *ppTreeNode;
- (*ppTreeNode)->parent = NULL;
- }else{
- pTreeNode->data = pLeftMax->data;
- pLeftMax->parent->right_child = pLeftMax->left_child;
- pLeftMax->left_child->parent = pLeftMax->parent;
- pTreeNode = pLeftMax;
- }
- }
- free(pTreeNode);
- return TRUE;
- }
- return _delete_node_from_tree(pTreeNode);
- }
3、 普通节点的删除
(待续)