From 36ad82b0fed2e521f750e906b70f78d324910a76 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Thu, 26 Oct 2023 10:56:36 -0400 Subject: [PATCH] adjusting the link --- lectures/17_trees_I/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/17_trees_I/README.md b/lectures/17_trees_I/README.md index 730f154..26f3788 100644 --- a/lectures/17_trees_I/README.md +++ b/lectures/17_trees_I/README.md @@ -103,7 +103,7 @@ integer. Hint: think recursively! ## 17.7 ds_set and Binary Search Tree Implementation -- A partial implementation of a set using a binary search tree is [here](ds_set_starter.h). We will continue to study this implementation in Lab 10 & the next lecture. +- A partial implementation of a set using a binary search tree is provided in this [ds_set_starter.h](ds_set_starter.h). We will continue to study this implementation in Lab 10 & the next lecture. - The increment and decrement operations for iterators have been omitted from this implementation. Next week in lecture we will discuss a couple strategies for adding these operations. - We will use this as the basis both for understanding an initial selection of tree algorithms and for thinking