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

Update README.md

Browse Source 
Moved the second picture up from overview section
This commit is contained in:
NehaKeshan
2023-10-27 11:34:28 -04:00
committed by GitHub
parent 1615cccfc6
commit 154dd98f96
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
lectures/17_trees_I/README.md
View File

@@ -97,6 +97,8 @@ public:
- Note: Sometimes a 3rd pointer — to the parent TreeNode — is added. - Note: Sometimes a 3rd pointer — to the parent TreeNode — is added.
![alt text](ds_set_diagram.png "ds set diagram")
## 17.6 Exercises ## 17.6 Exercises
1. Write a templated function to find the smallest value stored in a binary search tree whose root node is pointed 1. Write a templated function to find the smallest value stored in a binary search tree whose root node is pointed
@@ -128,8 +130,6 @@ node) that does all of the work.
- Because the class stores and manages dynamically allocated memory, a copy constructor, operator=, and - Because the class stores and manages dynamically allocated memory, a copy constructor, operator=, and
destructor must be provided. destructor must be provided.
![alt text](ds_set_diagram.png "ds set diagram")
## 17.9 Exercises ## 17.9 Exercises
1. Provide the implementation of the member function ds_set<T>::begin. This is essentially the problem of 1. Provide the implementation of the member function ds_set<T>::begin. This is essentially the problem of