From 695bd21a4625784fafbafa0e07b6e743c9c4d01a Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Mon, 30 Oct 2023 20:57:36 -0400 Subject: [PATCH] adding underscore --- labs/10_trees_I/README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/labs/10_trees_I/README.md b/labs/10_trees_I/README.md index 7ea28ab..58f9595 100644 --- a/labs/10_trees_I/README.md +++ b/labs/10_trees_I/README.md @@ -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