10_排序二叉树删除-2
来源:互联网 发布:mastercam自动编程 编辑:程序博客网 时间:2024/05/29 09:08
出处:http://blog.csdn.net/feixiaoxing/article/details/6867997
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、 普通节点的删除
0 0
- 10_排序二叉树删除-2
- 9_排序二叉树删除-1
- 11_排序二叉树删除-3
- 排序二叉树删除
- 7_排序二叉树
- 树-排序二叉树删除
- 8_排序二叉树插入
- 20170515_建立排序二叉树BST
- 一步一步写算法(之排序二叉树删除-2)
- 一步一步写算法(之排序二叉树删除-2)
- 排序二叉树的插入和删除
- 【随笔】排序二叉树的删除问题
- 排序二叉树添加删除java实现
- 删除排序二叉树的节点
- 排序二叉树BST的基本操作(2)前驱,后继,删除
- 一步一步写算法(之排序二叉树删除-1)
- 一步一步写算法(之排序二叉树删除-3)
- C语言 排序二叉树 删除某个结点
- 机器学习&深度学习实践(Python版)----Multivariate Linear Regression(多元线性回归)
- 压缩感知(Compressive Sensing)学习之(一)
- 成为伪程序员了
- IOS获取当前位置坐标不执行代理方法
- 棍子英雄
- 10_排序二叉树删除-2
- 压缩感知(Compressive Sensing)学习之(二)
- Gradle目录解析
- 关于Windous和Linux的ping的若干问题解决
- UICollectionView 瀑布流 初级
- 读取系统所有 图片 和缩略图
- Swift注释风格
- android中sharedPreferences的用法与json和数组的互转
- 浅谈依赖注入