Update README.md

Skip-List/README.md

@@ -1,3 +1,8 @@
 # Skip List
 
-> Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice for many applications. Skip list algorithms have the same asymptotic expected time bounds as balanced trees and are simpler, faster and use less space.  -**[William Pugh](https://en.wikipedia.org/wiki/William_Pugh)**
+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.
+
+A layer consists of a Head node, holding reference to the next and the node below. Each node has also same references similar to the Head node.
+
+#TODO
+ - finish readme