From ec04afc54fccb6ff4c2f5fe32833e0116ac174b3 Mon Sep 17 00:00:00 2001
From: enqidu <dachikurcxalia@gmail.com>
Date: Tue, 7 Jul 2020 13:34:13 +0400
Subject: [PATCH] added skip-list

---
 data_structures/skip_list.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/data_structures/skip_list.cpp b/data_structures/skip_list.cpp
index 8b6ec1f70..31e6d06f4 100644
--- a/data_structures/skip_list.cpp
+++ b/data_structures/skip_list.cpp
@@ -2,7 +2,7 @@
  * A skip list is a data structure that is used for storing a sorted list of items with a
  *  help of hierarchy of linked lists that connect increasingly sparse subsequences of the items
  * 
- *  References used: GeeksForGeeks, https://iq.opengenus.org/skip-list/ Pseudo Code, https://ideone.com/XnXIFl from CodeForces.
+ *  References used: GeeksForGeeks skip list code, https://iq.opengenus.org/skip-list/ Pseudo Code.
 */
 
 #include <iostream>
@@ -104,7 +104,7 @@ void SkipList::insertElement(int key, void* value) {
     }
 }; 
   
-// Delete element from skip list 
+
 void SkipList::deleteElement(int key) 
 { 
     Node *x = header;