skip lists
play

Skip Lists An alternative to balanced trees Sorted data. Random. - PowerPoint PPT Presentation

Skip Lists An alternative to balanced trees Sorted data. Random. Expected times are O(log n). 1-2 Indexed lists. One-level index. 2nd-level index. 3rd-level index log-n-level index. Remember the problem with keeping trees


  1. Skip Lists

  2. An alternative to balanced trees Sorted data. Random. Expected times are O(log n).

  3. 1-2  Indexed lists. ◦ One-level index. ◦ 2nd-level index. ◦ 3rd-level index ◦ log-n-level index. Remember the problem with keeping trees  Problem: insertion and deletion. completely balanced”?  Solution: Randomized node height: Skip lists. ◦ Pugh, 1990 CACM.  http://www.cs.umd.edu/class/spring2002/cmsc42 0-0401/demo/SkipList2/ Note that we can iterate through the list easily and in increasing order, like a threaded BST”

  4.  Uses a bit more space, makes the code simpler.  Michael Goodrich and Roberto Tamassia.

  5. 3  No guarantees that we won't get O(N) behavior. ◦ The interaction of the random number generator and the order in which things are inserted/deleted could lead to a long chain of nodes with the same height. ◦ But this is very unlikely. ◦ Expec ected ed time for search, insert, and remove are O(log n).

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend