diff --git a/content/roadmaps/103-computer-science/content/122-kd-trees.md b/content/roadmaps/103-computer-science/content/122-kd-trees.md
index 11492b61e..8881b419c 100644
--- a/content/roadmaps/103-computer-science/content/122-kd-trees.md
+++ b/content/roadmaps/103-computer-science/content/122-kd-trees.md
@@ -1 +1,7 @@
-# Kd trees
\ No newline at end of file
+# K-D Trees
+
+K-D Trees are a data structure that allow for fast nearest neighbor search in high dimensional spaces. They are a generalization of binary search trees, and are used in a variety of applications, including computer vision and computational geometry.
+
+Free Content
+K-D Tree Algorithm
+K-d Trees - Computerphile
diff --git a/content/roadmaps/103-computer-science/content/123-skip-lists.md b/content/roadmaps/103-computer-science/content/123-skip-lists.md
index 2236ba881..93dcb7379 100644
--- a/content/roadmaps/103-computer-science/content/123-skip-lists.md
+++ b/content/roadmaps/103-computer-science/content/123-skip-lists.md
@@ -1 +1,7 @@
-# Skip lists
\ No newline at end of file
+# Skip Lists
+
+Skip lists are a data structure that allows you to perform operations on a sorted list in O(log n) time. Skip lists are a probabilistic data structure, which means that the probability of a certain operation taking a certain amount of time is a certain value. In the case of skip lists, the probability of an operation taking O(log n) time is 1.
+
+Free Content
+Randomization: Skip Lists
+Skip Lists - Wikipedia