adding underscore

This commit is contained in:
Jidong Xiao
2023-10-30 20:57:36 -04:00
parent 8ed7b55564
commit 695bd21a46

View File

@@ -41,17 +41,17 @@ What is the breadth-first traversal of the tree above?
Now lets 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). Now lets 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 ## Checkpoint 3
*estimate: 20-35 minutes* *estimate: 20-35 minutes*
The implementation of the copy constructor and the assignment operator is not yet complete 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 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 written. Write *copy_tree* and then test to see if it works by “uncommenting” the appropriate code from the
main function. main function.
**To complete this checkpoint**: Show one of the TAs your new code. Be prepared to discuss the running **To complete this checkpoint**: Show one of the TAs your new code. Be prepared to discuss the running