steven/TinySTL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

完成删除

Browse Source
This commit is contained in:
邹晓航
2014-10-31 14:42:48 +08:00
parent d4eab62cac
commit 32800c4621
1 changed files with 49 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
TinySTL/AVLTree.h
View File

@@ -42,9 +42,9 @@ namespace TinySTL{
avl_tree& operator = (const avl_tree&) = delete; avl_tree& operator = (const avl_tree&) = delete;
~avl_tree(){ destroyAndDeallocateAllNodes(root_); } ~avl_tree(){ destroyAndDeallocateAllNodes(root_); }
void insert(const T& val);//todo void insert(const T& val);
template<class Iterator> template<class Iterator>
void insert(Iterator first, Iterator last);//todo void insert(Iterator first, Iterator last);
void erase(const T& val);//todo void erase(const T& val);//todo
size_t height()const{ return getHeight(root_); } size_t height()const{ return getHeight(root_); }
@@ -90,6 +90,7 @@ namespace TinySTL{
} }
private: private:
void insert_elem(const T& val, node *&p); void insert_elem(const T& val, node *&p);
void erase_elem(const T& val, node *&p);
void destroyAndDeallocateAllNodes(node *p){ void destroyAndDeallocateAllNodes(node *p){
if (p != 0){ if (p != 0){
destroyAndDeallocateAllNodes(p->left_); destroyAndDeallocateAllNodes(p->left_);
@@ -107,6 +108,51 @@ namespace TinySTL{
void print_postorder_aux(const string& delim, std::ostream& os, const node *ptr)const; void print_postorder_aux(const string& delim, std::ostream& os, const node *ptr)const;
};// end of avl_tree };// end of avl_tree
template<class T> template<class T>
void avl_tree<T>::erase_elem(const T& val, node *&p){
if (p == 0)
return;
if (p->data_ < val){
erase_elem(val, p->right_);
}else if (p->data_ > val){
erase_elem(val, p->left_);
}else{// found
if (p->left_ != 0 && p->right_ != 0){//has two children
size_t choose = size_ % 2;
//<2F><><EFBFBD><EFBFBD>ѡ<EFBFBD><D1A1>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD><EFBFBD>ң<EFBFBD>ʹ<EFBFBD><CAB9>ɾ<EFBFBD><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƽ<EFBFBD><C6BD>
auto pos = (choose == 0 ?
const_cast<node *>(find_min_aux(p->right_).ptr_) : const_cast<node *>(find_max_aux(p->left_).ptr_));
p->data_ = pos->data_;
(choose == 0 ? erase_elem(pos->data_, p->right_) : erase_elem(pos->data_, p->left_));
}else{ //has one or no child
auto temp = p;
if (p->left_ == 0)
p = p->right_;
else
p = p->left_;
dataAllocator::deallocate(temp);
--size_;
}
}
if (p != 0){//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>p<EFBFBD>Ľڵ<C4BD><DAB5>߶<EFBFBD><DFB6><EFBFBD>Ϣ<EFBFBD><CFA2><EFBFBD><EFBFBD>תά<D7AA><CEAC>ƽ<EFBFBD><C6BD>
p->height_ = max(getHeight(p->left_), getHeight(p->right_)) + 1;
if (getHeight(p->left_) - getHeight(p->right_) == 2){
if (p->left_->right_ == 0)
singleLeftLeftRotate(p);
else
doubleLeftRightRotate(p);
}else if (getHeight(p->right_) - getHeight(p->left_) == 2){
if (p->right_->left_ == 0)
singleRightRightRotate(p);
else
doubleRightLeftRotate(p);
}
}
}
template<class T>
void avl_tree<T>::erase(const T& val){
return erase_elem(val, root_);
}
template<class T>
void avl_tree<T>::insert_elem(const T& val, node *&p){ void avl_tree<T>::insert_elem(const T& val, node *&p){
if (p == 0){ if (p == 0){
p = dataAllocator::allocate(); p = dataAllocator::allocate();
@@ -131,8 +177,7 @@ namespace TinySTL{
p = doubleLeftRightRotate(p); p = doubleLeftRightRotate(p);
} }
} }
int l = getHeight(p->left_), r = getHeight(p->right_); p->height_ = max(getHeight(p->left_), getHeight(p->right_)) + 1;
p->height_ = max(l, r) + 1;
} }
template<class T> template<class T>
void avl_tree<T>::insert(const T& val){ void avl_tree<T>::insert(const T& val){