Skip to content

Commit c20c4de

Browse files
authored
Update README.md
1 parent 25a82a8 commit c20c4de

File tree

1 file changed

+1
-3
lines changed

1 file changed

+1
-3
lines changed

Skip-List/README.md

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,6 @@
11
# Skip List
22

3-
Skip List is a probablistic data-structure with same efficiency as AVL tree or Red-Black tree. Fast searching is possible by building a hierarchy of sorted linked-lists acting as an express lane to the layer underneath. Layers are created on top of the base layer ( regular sorted linked-list ) probablisticly by coin-flipping.
4-
5-
A layer consists of a Head node, holding reference to the next and the node below. Each node also holds references similar to the Head node.
3+
Skip List is a probablistic data-structure with same efficiency as AVL tree or Red-Black tree. The building blocks are hierarchy of layers (regular sorted linked-lists), created probablisticly by coin flipping, each acting as an express lane to the layer underneath, therefore making fast O(log n) search possible by skipping lanes. A layer consists of a Head node, holding reference to the subsequent and the node below. Each node also holds similar references as the Head node.
64

75
#TODO
86
- finish readme

0 commit comments

Comments
 (0)