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

correcting the format

Browse Source
This commit is contained in:
Jidong Xiao
2023-12-04 22:05:42 -05:00
parent ceb6addb05
commit c159c1ca89
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lectures/27_hybrid_data_structures/README.md
View File

@@ -73,7 +73,7 @@ lowest level (level 1). ’42’ is after ’31’, but before ’58’, so we s
## 27.5 Skip List - Discussion ## 27.5 Skip List - Discussion
How are elements inserted & erased? (Once the location is found) Just edit the chain at each level. - How are elements inserted & erased? (Once the location is found) Just edit the chain at each level.
- But how do we determine what nodes go at each level? Upon insertion, generate a top level for that element - But how do we determine what nodes go at each level? Upon insertion, generate a top level for that element
at random (from [0,log n] where n is the # of elements currently in the list ... details omitted!) at random (from [0,log n] where n is the # of elements currently in the list ... details omitted!)
- The overall hierarchy of a skip list is similar to a binary search tree. Both a skip list and a binary search tree - The overall hierarchy of a skip list is similar to a binary search tree. Both a skip list and a binary search tree