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

include links to set implementation'

Browse Source
This commit is contained in:
Jidong Xiao
2025-03-21 13:42:14 -04:00
committed by JamesFlare
parent 230751b5b8
commit be8d649ead
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lectures/19_trees_II/README.md
View File

@@ -107,6 +107,8 @@ Exercise: What are the advantages & disadvantages of each method?
## 19.5 Limitations of Our BST Implementation ## 19.5 Limitations of Our BST Implementation
- An implementation of a set using a binary search tree is provided in this [ds_set.h](ds_set.h).
- A testing program is provided as well: [ds_set_main.cpp](ds_set_main.cpp).
- The efficiency of the main insert, find and erase algorithms depends on the height of the tree. - The efficiency of the main insert, find and erase algorithms depends on the height of the tree.
- The best-case and average-case heights of a binary search tree storing n nodes are both O(log n). The worstcase, which often can happen in practice, is O(n). - The best-case and average-case heights of a binary search tree storing n nodes are both O(log n). The worstcase, which often can happen in practice, is O(n).
- Developing more sophisticated algorithms to avoid the worst-case behavior will be covered in Introduction to - Developing more sophisticated algorithms to avoid the worst-case behavior will be covered in Introduction to