JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

starter set code

Browse Source
This commit is contained in:
Jidong Xiao
2025-03-18 13:54:57 -04:00
committed by JamesFlare1212
parent 2b7a3f5b7f
commit 62611ff8c8
1 changed files with 4 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

55
lectures/18_trees_I/ds_set_starter.h
View File

@@ -34,7 +34,6 @@ public:
// comparison operators are straightforward // comparison operators are straightforward
bool operator==(const tree_iterator& r) { return ptr_ == r.ptr_; } bool operator==(const tree_iterator& r) { return ptr_ == r.ptr_; }
bool operator!=(const tree_iterator& r) { return ptr_ != r.ptr_; } bool operator!=(const tree_iterator& r) { return ptr_ != r.ptr_; }
// increment & decrement will be discussed in Lecture 18 and Lab 11
private: private:
// representation // representation
@@ -60,67 +59,21 @@ public:
} }
typedef tree_iterator<T> iterator; typedef tree_iterator<T> iterator;
int size() const { return size_; }
bool operator==(const ds_set<T>& old) const { return (old.root_ == this->root_); }
// FIND, INSERT & ERASE
iterator find(const T& key_value) { return find(key_value, root_); } iterator find(const T& key_value) { return find(key_value, root_); }
std::pair< iterator, bool > insert(T const& key_value) { return insert(key_value, root_); } std::pair< iterator, bool > insert(T const& key_value) { return insert(key_value, root_); }
int erase(T const& key_value) { return erase(key_value, root_); }
// OUTPUT & PRINTING
friend std::ostream& operator<< (std::ostream& ostr, const ds_set<T>& s) {
s.print_in_order(ostr, s.root_);
return ostr;
}
void print_as_sideways_tree(std::ostream& ostr) const { print_as_sideways_tree(ostr, root_, 0); }
// ITERATORS // ITERATORS
iterator begin() const { iterator begin() const {
} }
iterator end() const { return iterator(NULL); } iterator end() const { return iterator(NULL); }
private: private:
// REPRESENTATION // REPRESENTATION
TreeNode<T>* root_; TreeNode<T>* root_;
int size_; int size_;
iterator find(const T& key_value, TreeNode<T>* p) { /* to be implemented */ }
// PRIVATE HELPER FUNCTIONS std::pair<iterator,bool> insert(const T& key_value, TreeNode<T>*& p) { /* to be implemented */ }
TreeNode<T>* copy_tree(TreeNode<T>* old_root) { /* Implemented in Lab 9 */ } void destroy_tree(TreeNode<T>* p) { /* to be implemented */ }
void destroy_tree(TreeNode<T>* p) { /* Implemented in Lecture 18 */ }
iterator find(const T& key_value, TreeNode<T>* p) {
}
std::pair<iterator,bool> insert(const T& key_value, TreeNode<T>*& p) { /* Discussed in Lecture 18 */ }
int erase(T const& key_value, TreeNode<T>* &p) { /* Implemented in Lecture 19 */ }
void print_in_order(std::ostream& ostr, const TreeNode<T>* p) const {
if (p) {
print_in_order(ostr, p->left);
ostr << p->value << "\n";
print_in_order(ostr, p->right);
}
}
void print_as_sideways_tree(std::ostream& ostr, const TreeNode<T>* p, int depth) const {
}; };
#endif #endif