IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS
A skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list....
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | 図書 |
| 出版事項: |
College of Education for Women,
2019-02-01T00:00:00Z.
|
| 主題: | |
| オンライン･アクセス: | Connect to this object online. |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
インターネット
Connect to this object online.3rd Floor Main Library
| 請求記号: |
A1234.567 |
|---|---|
| 所蔵 1 | 利用可 |