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

remove some useless comments

Browse Source
This commit is contained in:
Jidong Xiao
2025-03-24 19:24:42 -04:00
committed by JamesFlare
parent 1556940408
commit e783fa7d83
1 changed files with 2 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
labs/trees_I/ds_set.h
View File

@@ -34,7 +34,6 @@ public:
// comparions operators are straightforward // comparions operators are straightforward
bool operator== (const tree_iterator& rgt) { return ptr_ == rgt.ptr_; } bool operator== (const tree_iterator& rgt) { return ptr_ == rgt.ptr_; }
bool operator!= (const tree_iterator& rgt) { return ptr_ != rgt.ptr_; } bool operator!= (const tree_iterator& rgt) { return ptr_ != rgt.ptr_; }
// increment & decrement will be discussed in Lecture 19 and Lab 11
private: private:
// representation // representation
@@ -93,7 +92,6 @@ private:
// PRIVATE HELPER FUNCTIONS // PRIVATE HELPER FUNCTIONS
TreeNode<T>* copy_tree(TreeNode<T>* old_root) { TreeNode<T>* copy_tree(TreeNode<T>* old_root) {
// Implemented in Lab 10
@@ -106,7 +104,7 @@ private:
} }
void destroy_tree(TreeNode<T>* p) { /* Implemented in Lecture 18 */ } void destroy_tree(TreeNode<T>* p) { }
iterator find(const T& key_value, TreeNode<T>* p) { iterator find(const T& key_value, TreeNode<T>* p) {
if (!p) return iterator(NULL); if (!p) return iterator(NULL);
@@ -132,7 +130,7 @@ private:
return std::pair<iterator,bool>(iterator(p), false); return std::pair<iterator,bool>(iterator(p), false);
} }
int erase(T const& key_value, TreeNode<T>* &p) { /* Implemented in Lecture 19 or 20 */ } int erase(T const& key_value, TreeNode<T>* &p) { }
void print_in_order(std::ostream& ostr, const TreeNode<T>* p) const { void print_in_order(std::ostream& ostr, const TreeNode<T>* p) const {
if (p) { if (p) {