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-17 17:22:00 +08:00
parent 132dae1a73
commit 02c95de420
1 changed files with 10 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
TinySTL/BinarySearchTree.h
View File

@@ -32,7 +32,9 @@ namespace TinySTL{
binary_search_tree() :root_(0){} binary_search_tree() :root_(0){}
binary_search_tree(const binary_search_tree&) = delete; binary_search_tree(const binary_search_tree&) = delete;
binary_search_tree& operator=(const binary_search_tree&) = delete; binary_search_tree& operator=(const binary_search_tree&) = delete;
~binary_search_tree(){}//TODO ~binary_search_tree(){
deallocateAllNodes(root_);
}
void insert(const T& val); void insert(const T& val);
@@ -40,6 +42,13 @@ namespace TinySTL{
void print_inorder(const string& delim = " ", std::ostream& os = std::cout)const; void print_inorder(const string& delim = " ", std::ostream& os = std::cout)const;
void print_postorder(const string& delim = " ", std::ostream& os = std::cout)const; void print_postorder(const string& delim = " ", std::ostream& os = std::cout)const;
private: private:
void deallocateAllNodes(node *ptr){
if (ptr){
deallocateAllNodes(ptr->left_);
deallocateAllNodes(ptr->right_);
nodeAllocator::deallocate(ptr);
}
}
void insert_elem(const T& val, node *&ptr); void insert_elem(const T& val, node *&ptr);
void print_preorder_aux(const string& delim, std::ostream& os, const node *ptr)const; void print_preorder_aux(const string& delim, std::ostream& os, const node *ptr)const;
void print_inorder_aux(const string& delim, std::ostream& os, const node *ptr)const; void print_inorder_aux(const string& delim, std::ostream& os, const node *ptr)const;