关键在于删除
分三种情况:
1.删除的是叶节点,直接删除,并修改其父节点对应的节点指针为nullprt
2.删除只有一个子节点的节点: 将父节点的指针指向要删除节点的子节点
3.要删除的节点有左右两颗子树:用另一节点替代被删除节点:被替代的元素必须满足这样的条件:比删除节点的所有左子树都要大,比右子树的所有元素都要小
所以我们可以选择右子树的最小元素或者左子树的最大元素.
好处是:右子树的最小元素 一定是在右子树的最左边,左子树的最大元素一定是左子树的最右边。
C/C++实现
#include <stack>//栈
#include <queue>
#include <iostream>
#include <initializer_list>
using namespace std;
template <typename Comparable>
class BinarySearchTree
{
private:
struct BinaryNode
{
Comparable element;
BinaryNode * left;
BinaryNode * right;
BinaryNode(const Comparable & theElement, BinaryNode *lt, BinaryNode *rt)
:element(theElement), left(lt), right(rt) {
}
BinaryNode(Comparable && theElement, BinaryNode *lt, BinaryNode *rt)
:element(std::move(theElement)), left(lt), right(rt) {
}
};
BinaryNode * root;
void Insert(const Comparable &x, BinaryNode * & t);
void Insert(Comparable && x, BinaryNode *&t);
void Insert(initializer_list<Comparable> &d, BinaryNode *& t);
void Remove(const Comparable &x, BinaryNode *&t);
BinaryNode * findMin(BinaryNode *t)const;
BinaryNode * findMax(BinaryNode *t)const;
bool contains(const Comparable &x, BinaryNode *t) const;
void makeEmpty(BinaryNode * &t);
void PrintTree(BinaryNode *t) const;
BinaryNode* clone(BinaryNode *t)const
{
if (t == nullptr)
return nullptr;
return new BinaryNode(t->element, clone(t->left), clone(t->right));
}
public:
BinarySearchTree() :root(nullptr) {
}
BinarySearchTree(const BinarySearchTree & rhs) :root(nullptr) {
root = clone(rhs.root); }
BinarySearchTree(BinarySearchTree && rhs) :root(nullptr) {
root = rhs.root;rhs = nullptr;}
~BinarySearchTree() {
makeEmpty(); }
const Comparable & findMin() const {
return findMin(root)->element; }
const Comparable & findMax() const {
findMax(root)->element; }
bool contains(const Comparable & x) const {
return contains(x, root); }
bool isEmpty() const {
return root == nullptr; }
void PrintTree()const {
PrintTree(root); }
void