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

commenting out B+ trees

Browse Source
This commit is contained in:
Jidong Xiao
2025-03-20 23:45:06 -04:00
committed by JamesFlare
parent 640cfc6c08
commit fb81b68821
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
lectures/19_trees_II/README.md
View File

@@ -112,7 +112,9 @@ Exercise: What are the advantages & disadvantages of each method?
- 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).
- Developing more sophisticated algorithms to avoid the worst-case behavior will be covered in Introduction to
Algorithms. <!-- One elegant extension to the binary search tree is described below...
Algorithms.
<!-- One elegant extension to the binary search tree is described below...
## 19.6 B+ Trees
@@ -132,8 +134,7 @@ implementation).
child must be < key0, the next child must have keys such that they are ≥key0 and < key1, and so on up to
the rightmost child which has only keys ≥keyk−1.
A B+ tree visualization can be seen at: https://www.cs.usfca.edu/~galles/visualization/BPlusTree.html
-->
A B+ tree visualization can be seen at: https://www.cs.usfca.edu/~galles/visualization/BPlusTree.html -->
## 19.6 N-ary tree and General Tree