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

迭代器添加新接口，bst删除操作更平衡

Browse Source
This commit is contained in:
邹晓航
2014-10-18 12:22:59 +08:00
parent cf03d6f2af
commit 303a07d6ac
1 changed files with 9 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
TinySTL/BinarySearchTree.h
View File

@@ -48,6 +48,7 @@ namespace TinySTL{
bool empty()const{ return root_ == 0; }
size_t size()const{ return size_; }
const_iterator root(){ return const_iterator(root_, this); }
const_iterator cbegin(){ return find_min(); }
const_iterator cend(){ return const_iterator(0, this); }
@@ -87,9 +88,12 @@ namespace TinySTL{
return erase_elem(val, ptr->right_);
}else{ // found
if (ptr->left_ != 0 && ptr->right_ != 0){// has two children
auto pos = const_cast<node *>(find_min_aux(ptr->right_).ptr_);
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(ptr->right_).ptr_) : const_cast<node *>(find_max_aux(ptr->left_).ptr_));
ptr->data_ = pos->data_;
return erase_elem(pos->data_, ptr->right_);
return (choose == 0 ? erase_elem(pos->data_, ptr->right_) : erase_elem(pos->data_, ptr->left_));
}else{ //has one or no child
auto temp = ptr;
if (ptr->left_ == 0)
@@ -241,6 +245,9 @@ namespace TinySTL{
const_reference operator*(){ return ptr_->data_; }
const_pointer operator ->(){ return &(operator*()); }
bst_iter left()const{ return bst_iter(ptr_->left_, container_); }
bst_iter right()const{ return bst_iter(ptr_->right_, container_); }
bst_iter& operator ++();
bst_iter operator ++(int);
bst_iter& operator --();