diff --git a/src/data-structures/hash-table/README.md b/src/data-structures/hash-table/README.md
index df199257..3aec51b5 100644
--- a/src/data-structures/hash-table/README.md
+++ b/src/data-structures/hash-table/README.md
@@ -5,18 +5,19 @@ _Read this in other languages:_
 [_Русский_](README.ru-RU.md),
 [_日本語_](README.ja-JP.md),
 [_Français_](README.fr-FR.md),
-[_Português_](README.pt-BR.md), [_한국어_](README.ko-KR.md)
+[_Português_](README.pt-BR.md),
+[_한국어_](README.ko-KR.md)
 
-In computing, a **hash table** (hash map) is a data 
-structure which implements an *associative array* 
-abstract data type, a structure that can *map keys 
-to values*. A hash table uses a *hash function* to 
-compute an index into an array of buckets or slots, 
+In computing, a **hash table** (hash map) is a data
+structure which implements an *associative array*
+abstract data type, a structure that can *map keys
+to values*. A hash table uses a *hash function* to
+compute an index into an array of buckets or slots,
 from which the desired value can be found
 
-Ideally, the hash function will assign each key to a 
-unique bucket, but most hash table designs employ an 
-imperfect hash function, which might cause hash 
+Ideally, the hash function will assign each key to a
+unique bucket, but most hash table designs employ an
+imperfect hash function, which might cause hash
 collisions where the hash function generates the same
 index for more than one key. Such collisions must be
 accommodated in some way.
diff --git a/src/data-structures/heap/README.md b/src/data-structures/heap/README.md
index cbd7f12e..2610a9ff 100644
--- a/src/data-structures/heap/README.md
+++ b/src/data-structures/heap/README.md
@@ -6,9 +6,10 @@ _Read this in other languages:_
 [_日本語_](README.ja-JP.md),
 [_Français_](README.fr-FR.md),
 [_Português_](README.pt-BR.md),
-[_Türkçe_](README.tr-TR.md)
+[_Türkçe_](README.tr-TR.md),
+[_한국어_](README.ko-KR.md)
 
-In computer science, a **heap** is a specialized tree-based 
+In computer science, a **heap** is a specialized tree-based
 data structure that satisfies the heap property described
 below.
 
@@ -23,7 +24,7 @@ to the key of `C`
 
 ![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
 
-The node at the "top" of the heap with no parents is 
+The node at the "top" of the heap with no parents is
 called the root node.
 
 ## References
diff --git a/src/data-structures/queue/README.md b/src/data-structures/queue/README.md
index 86046d8f..4db98224 100644
--- a/src/data-structures/queue/README.md
+++ b/src/data-structures/queue/README.md
@@ -5,22 +5,23 @@ _Read this in other languages:_
 [_Русский_](README.ru-RU.md),
 [_日本語_](README.ja-JP.md),
 [_Français_](README.fr-FR.md),
-[_Português_](README.pt-BR.md), [_한국어_](README.ko-KR.md)
+[_Português_](README.pt-BR.md),
+[_한국어_](README.ko-KR.md)
 
-In computer science, a **queue** is a particular kind of abstract data 
-type or collection in which the entities in the collection are 
-kept in order and the principle (or only) operations on the 
-collection are the addition of entities to the rear terminal 
-position, known as enqueue, and removal of entities from the 
-front terminal position, known as dequeue. This makes the queue 
-a First-In-First-Out (FIFO) data structure. In a FIFO data 
-structure, the first element added to the queue will be the 
-first one to be removed. This is equivalent to the requirement 
-that once a new element is added, all elements that were added 
-before have to be removed before the new element can be removed. 
-Often a peek or front operation is also entered, returning the 
-value of the front element without dequeuing it. A queue is an 
-example of a linear data structure, or more abstractly a 
+In computer science, a **queue** is a particular kind of abstract data
+type or collection in which the entities in the collection are
+kept in order and the principle (or only) operations on the
+collection are the addition of entities to the rear terminal
+position, known as enqueue, and removal of entities from the
+front terminal position, known as dequeue. This makes the queue
+a First-In-First-Out (FIFO) data structure. In a FIFO data
+structure, the first element added to the queue will be the
+first one to be removed. This is equivalent to the requirement
+that once a new element is added, all elements that were added
+before have to be removed before the new element can be removed.
+Often a peek or front operation is also entered, returning the
+value of the front element without dequeuing it. A queue is an
+example of a linear data structure, or more abstractly a
 sequential collection.
 
 Representation of a FIFO (first in, first out) queue