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

adding underscore

Browse Source
This commit is contained in:
Jidong Xiao
2023-10-30 20:57:36 -04:00
parent 8ed7b55564
commit 695bd21a46
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
labs/10_trees_I/README.md
View File

@@ -41,17 +41,17 @@ What is the breadth-first traversal of the tree above?
Now let’s explore the implementation of the ds_set class, along with the use of recursive functions to manipulate binary search trees. Download and examine the files: [ds_set.h](ds_set.h) and [test_ds_set.cpp](test_ds_set.cpp).
The implementation of find provided in ds_set.h is recursive. Re-implement and test a non-recursive replacement for this function.
The implementation of *find* provided in ds_set.h is recursive. Re-implement and test a non-recursive replacement for this function.
**To complete this checkpoint**: Show one of the TAs your new code. Be prepared to discuss the running time for the two different versions of find for various inputs.
**To complete this checkpoint**: Show one of the TAs your new code. Be prepared to discuss the running time for the two different versions of *find* for various inputs.
## Checkpoint 3
*estimate: 20-35 minutes*
The implementation of the copy constructor and the assignment operator is not yet complete
because each depends on a private member function called copy_tree, the body of which has not yet been
written. Write copy_tree and then test to see if it works by “uncommenting” the appropriate code from the
because each depends on a private member function called *copy_tree*, the body of which has not yet been
written. Write *copy_tree* and then test to see if it works by “uncommenting” the appropriate code from the
main function.
**To complete this checkpoint**: Show one of the TAs your new code. Be prepared to discuss the running