【数据结构】64_二叉树中的结点删除与清除
二叉树中的结点删除
删除方式
基于数据元素值的删除node
- SharedPointer<Tree<T>> remove(const T &value);
基于结点的删除ios
- SharedPointer<Tree<T>> remove(TreeNode<T> *node);
二叉树中结点的删除
删除操做功能的定义
void removeP(BTreeNode<T> node, Btree<T> *&ret);编程
- 将 node 做为根结点的子树从原来的二叉树中删除
- ret 做为子树返回 （ret 指向堆空间中的二叉树对象）
编程实验：二叉树结点的删除操做
#ifndef BTREE_H
#define BTREE_H
#include "Tree.h"
#include "BTreeNode.h"
#include "Exception.h"
#include "LinkQueue.h"
namespace DTLib
{
template <typename T>
class BTree : public Tree<T>
{
public:
BTree() = default;
bool insert(TreeNode<T> *node) override
{
return insert(node, ANY);
}
virtual bool insert(TreeNode<T> *node, BTNodePos pos)
{
bool ret = true;
if (node != nullptr)
{
if (this->m_root == nullptr)
{
node->parent = nullptr;
this->m_root = node;
}
else
{
BTreeNode<T> *np = find(node->parent);
if (np != nullptr)
{
ret = insert(dynamic_cast<BTreeNode<T>*>(node), np, pos);
}
else
{
THROW_EXCEPTION(InvalidParameterExcetion, "Invalid parent tree node ...");
}
}
}
else
{
THROW_EXCEPTION(InvalidParameterExcetion, "Parameter can not be null ...");
}
return ret;
}
bool insert(const T &value, TreeNode<T> *parent) override
{
return insert(value, parent, ANY);
}
virtual bool insert(const T &value, TreeNode<T> *parent, BTNodePos pos)
{
bool ret = true;
BTreeNode<T> *node = BTreeNode<T>::NewNode();
if (node != nullptr)
{
node->value = value;
node->parent = parent;
ret = insert(node, pos);
if (!ret)
{
delete node;
}
}
else
{
THROW_EXCEPTION(NoEnoughMemoryException, "No enough memory to create node ...");
}
return ret;
}
SharedPointer<Tree<T>> remove(const T &value) override
{
BTree<T> *ret = nullptr;
BTreeNode<T> *node = find(value);
if (node != nullptr)
{
remove(node, ret);
}
else
{
THROW_EXCEPTION(InvalidParameterExcetion, "Can not find the tree node via value ...");
}
return ret;
}
SharedPointer<Tree<T>> remove(TreeNode<T> *node) override
{
BTree<T> *ret = nullptr;
node = find(node);
if (node != nullptr)
{
remove(dynamic_cast<BTreeNode<T>*>(node), ret);
}
else
{
THROW_EXCEPTION(InvalidParameterExcetion, "Parameter node is invalid ...");
}
return ret;
}
BTreeNode<T>* find(const T &value) const override
{
return find(root(), value);
}
BTreeNode<T>* find(TreeNode<T> *node) const override
{
return find(root(), dynamic_cast<BTreeNode<T>*>(node));
}
BTreeNode<T>* root() const override
{
return dynamic_cast<BTreeNode<T>*>(this->m_root);
}
int degree() const override
{
return 0;
}
int count() const override
{
return 0;
}
int height() const
{
return 0;
}
void clear() override
{
this->m_root = nullptr;
}
~BTree()
{
clear();
}
protected:
BTree(const BTree<T>&) = default;
BTree<T>& operator = (const BTree<T>&) = default;
virtual BTreeNode<T>* find(BTreeNode<T> *node, const T &value) const
{
BTreeNode<T> *ret = nullptr;
if (node != nullptr)
{
if (node->value == value)
{
ret = node;
}
else
{
if (ret == nullptr)
{
ret = find(node->left, value);
}
if (ret == nullptr)
{
ret = find(node->right, value);
}
}
}
return ret;
}
virtual BTreeNode<T>* find(BTreeNode<T> *node, BTreeNode<T> *obj) const
{
BTreeNode<T> *ret = nullptr;
if (node == obj)
{
ret = node;
}
else
{
if (node != nullptr)
{
if (ret == nullptr)
{
ret = find(node->left, obj);
}
if (ret == nullptr)
{
ret = find(node->right, obj);
}
}
}
return ret;
}
virtual bool insert(BTreeNode<T> *node, BTreeNode<T> *np, BTNodePos pos)
{
bool ret = true;
if (pos == ANY)
{
if (np->left == nullptr)
{
np->left = node;
}
else if (np->right == nullptr)
{
np->right = node;
}
else
{
ret = false;
}
}
else if (pos == LEFT)
{
if (np->left == nullptr)
{
np->left = node;
}
else
{
ret = false;
}
}
else if (pos == RIGHT)
{
if (np->right == nullptr)
{
np->right = node;
}
else
{
ret = false;
}
}
return ret;
}
virtual void remove(BTreeNode<T> *node, BTree<T> *&ret)
{
ret = new BTree<T>();
if (ret != nullptr)
{
if (root() == node)
{
this->m_root = nullptr;
}
else
{
BTreeNode<T> *parent = dynamic_cast<BTreeNode<T>*>(node->parent);
if (node == parent->left)
{
parent->left = nullptr;
}
else if (node == parent->right)
{
parent->right = nullptr;
}
node->parent = nullptr;
}
ret->m_root = node;
}
else
{
THROW_EXCEPTION(NoEnoughMemoryException, "No memory to create btree ...");
}
}
};
}
#endif // BTREE_H
文件：main.cppide
#include <iostream>
#include "BTreeNode.h"
#include "BTree.h"
using namespace std;
using namespace DTLib;
int main()
{
BTree<int> bt;
BTreeNode<int> *n = nullptr;
bt.insert(1, nullptr);
n = bt.find(1);
bt.insert(2, n);
bt.insert(3, n);
n = bt.find(2);
bt.insert(4, n);
bt.insert(5, n);
n = bt.find(4);
bt.insert(8, n);
bt.insert(9, n);
n = bt.find(5);
bt.insert(10, n);
n = bt.find(3);
bt.insert(6, n);
bt.insert(7, n);
SharedPointer<Tree<int>> sp = bt.remove(3);
int a[] = {8, 9, 10, 6, 7};
for (int i=0; i<5; ++i)
{
TreeNode<int> *node = bt.find(a[i]);
while (node)
{
cout << node->value << " ";
node = node->parent;
}
cout << endl;
}
cout << "----------" << endl;
for (int i=0; i<5; ++i)
{
TreeNode<int> *node = sp->find(a[i]);
while (node)
{
cout << node->value << " ";
node = node->parent;
}
cout << endl;
}
return 0;
}
输出：this
8 4 2 1 9 4 2 1 10 5 2 1 ---------- 6 3 7 3
二叉树的清除
清除操做的定义
void clear();spa
- 将二叉树中的全部结点清除 （释放堆中的结点）
二叉树中结点的清除
清除操做的功能定义
free(node)code
- 清除 node 为根节点的二叉树
- 释放二叉树中的每个结点
编程实验：清除二叉树中的结点
文件：BTree.h对象
#ifndef BTREE_H
#define BTREE_H
#include "Tree.h"
#include "BTreeNode.h"
#include "Exception.h"
#include "LinkQueue.h"
namespace DTLib
{
template <typename T>
class BTree : public Tree<T>
{
public:
BTree() = default;
bool insert(TreeNode<T> *node) override
{
return insert(node, ANY);
}
virtual bool insert(TreeNode<T> *node, BTNodePos pos)
{
bool ret = true;
if (node != nullptr)
{
if (this->m_root == nullptr)
{
node->parent = nullptr;
this->m_root = node;
}
else
{
BTreeNode<T> *np = find(node->parent);
if (np != nullptr)
{
ret = insert(dynamic_cast<BTreeNode<T>*>(node), np, pos);
}
else
{
THROW_EXCEPTION(InvalidParameterExcetion, "Invalid parent tree node ...");
}
}
}
else
{
THROW_EXCEPTION(InvalidParameterExcetion, "Parameter can not be null ...");
}
return ret;
}
bool insert(const T &value, TreeNode<T> *parent) override
{
return insert(value, parent, ANY);
}
virtual bool insert(const T &value, TreeNode<T> *parent, BTNodePos pos)
{
bool ret = true;
BTreeNode<T> *node = BTreeNode<T>::NewNode();
if (node != nullptr)
{
node->value = value;
node->parent = parent;
ret = insert(node, pos);
if (!ret)
{
delete node;
}
}
else
{
THROW_EXCEPTION(NoEnoughMemoryException, "No enough memory to create node ...");
}
return ret;
}
SharedPointer<Tree<T>> remove(const T &value) override
{
BTree<T> *ret = nullptr;
BTreeNode<T> *node = find(value);
if (node != nullptr)
{
remove(node, ret);
}
else
{
THROW_EXCEPTION(InvalidParameterExcetion, "Can not find the tree node via value ...");
}
return ret;
}
SharedPointer<Tree<T>> remove(TreeNode<T> *node) override
{
BTree<T> *ret = nullptr;
node = find(node);
if (node != nullptr)
{
remove(dynamic_cast<BTreeNode<T>*>(node), ret);
}
else
{
THROW_EXCEPTION(InvalidParameterExcetion, "Parameter node is invalid ...");
}
return ret;
}
BTreeNode<T>* find(const T &value) const override
{
return find(root(), value);
}
BTreeNode<T>* find(TreeNode<T> *node) const override
{
return find(root(), dynamic_cast<BTreeNode<T>*>(node));
}
BTreeNode<T>* root() const override
{
return dynamic_cast<BTreeNode<T>*>(this->m_root);
}
int degree() const override
{
return 0;
}
int count() const override
{
return 0;
}
int height() const
{
return 0;
}
void clear() override
{
free(root());
this->m_root = nullptr;
}
~BTree()
{
clear();
}
protected:
BTree(const BTree<T>&) = default;
BTree<T>& operator = (const BTree<T>&) = default;
virtual BTreeNode<T>* find(BTreeNode<T> *node, const T &value) const
{
BTreeNode<T> *ret = nullptr;
if (node != nullptr)
{
if (node->value == value)
{
ret = node;
}
else
{
if (ret == nullptr)
{
ret = find(node->left, value);
}
if (ret == nullptr)
{
ret = find(node->right, value);
}
}
}
return ret;
}
virtual BTreeNode<T>* find(BTreeNode<T> *node, BTreeNode<T> *obj) const
{
BTreeNode<T> *ret = nullptr;
if (node == obj)
{
ret = node;
}
else
{
if (node != nullptr)
{
if (ret == nullptr)
{
ret = find(node->left, obj);
}
if (ret == nullptr)
{
ret = find(node->right, obj);
}
}
}
return ret;
}
virtual bool insert(BTreeNode<T> *node, BTreeNode<T> *np, BTNodePos pos)
{
bool ret = true;
if (pos == ANY)
{
if (np->left == nullptr)
{
np->left = node;
}
else if (np->right == nullptr)
{
np->right = node;
}
else
{
ret = false;
}
}
else if (pos == LEFT)
{
if (np->left == nullptr)
{
np->left = node;
}
else
{
ret = false;
}
}
else if (pos == RIGHT)
{
if (np->right == nullptr)
{
np->right = node;
}
else
{
ret = false;
}
}
return ret;
}
virtual void remove(BTreeNode<T> *node, BTree<T> *&ret)
{
ret = new BTree<T>();
if (ret != nullptr)
{
if (root() == node)
{
this->m_root = nullptr;
}
else
{
BTreeNode<T> *parent = dynamic_cast<BTreeNode<T>*>(node->parent);
if (node == parent->left)
{
parent->left = nullptr;
}
else if (node == parent->right)
{
parent->right = nullptr;
}
node->parent = nullptr;
}
ret->m_root = node;
}
else
{
THROW_EXCEPTION(NoEnoughMemoryException, "No memory to create btree ...");
}
}
virtual void free(BTreeNode<T> *node)
{
if (node != nullptr)
{
free(node->left);
free(node->right);
if (node->flag())
{
delete node;
}
}
}
};
}
#endif // BTREE_H
文件:main.cppblog
#include <iostream>
#include "BTreeNode.h"
#include "BTree.h"
using namespace std;
using namespace DTLib;
int main()
{
BTree<int> bt;
BTreeNode<int> *n = nullptr;
bt.insert(1, nullptr);
n = bt.find(1);
bt.insert(2, n);
bt.insert(3, n);
n = bt.find(2);
bt.insert(4, n);
bt.insert(5, n);
n = bt.find(4);
bt.insert(8, n);
bt.insert(9, n);
n = bt.find(5);
bt.insert(10, n);
n = bt.find(3);
bt.insert(6, n);
bt.insert(7, n);
bt.clear();
int a[] = {8, 9, 10, 6, 7};
for (int i=0; i<5; ++i)
{
TreeNode<int> *node = bt.find(a[i]);
while (node)
{
cout << node->value << " ";
node = node->parent;
}
cout << endl;
}
return 0;
}
输出：内存
小结
- 删除操做将目标结点所表明的子树移除
- 删除操做必须完善处理父结点和子结点的关系
- 清除操做用于销毁树中的每一个结点
- 销毁结点时判断是否释放对应的内存空间（工厂模式）
以上内容整理于狄泰软件学院系列课程，请你们保护原创！
相关文章
- 1. javascript数据结构与算法---二叉树（删除节点）
- 2. 数据结构-删除查找二叉树的节点
- 3. 数据结构 - 二叉树(删除节点)
- 4. 算法与数据结构学习（35）-树结构（二叉树结点的删除）
- 5. C++数据结构--二叉树的复制和删除
- 6. 【数据结构】平衡二叉树的插入、删除
- 7. 数据结构 二叉搜索树的删除
- 8. Java数据结构——二叉树 增长、删除、查询
- 9. 【数据结构】55_树中节点的清除操做
- 10. 【数据结构】56_树中节点的删除操做
- 更多相关文章...
- • XML 树结构 - XML 教程
- • XML DOM 删除节点 - XML DOM 教程
- • 算法总结-二分查找法
- • Flink 数据传输及反压详解
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
最新文章
- 1. 安装cuda+cuDNN
- 2. GitHub的使用说明
- 3. phpDocumentor使用教程【安装PHPDocumentor】
- 4. yarn run build报错Component is not found in path “npm/taro-ui/dist/weapp/components/rate/index“
- 5. 精讲Haproxy搭建Web集群
- 6. 安全测试基础之MySQL
- 7. C/C++编程笔记：C语言中的复杂声明分析，用实例带你完全读懂
- 8. Python3教程(1)----搭建Python环境
- 9. 李宏毅机器学习课程笔记2：Classification、Logistic Regression、Brief Introduction of Deep Learning
- 10. 阿里云ECS配置速记
欢迎关注本站公众号,获取更多信息
