From 4b6c601158b7b0284c9aad3a899fe97285fc7c1a Mon Sep 17 00:00:00 2001
From: Oleksii Trekhleb <trehleb@gmail.com>
Date: Sun, 20 Dec 2020 20:18:12 +0100
Subject: [PATCH] Add Spanish link for the Linked List README.

---
 src/algorithms/math/is-power-of-two/README.md | 15 ++++-----
 src/data-structures/linked-list/README.md     | 33 ++++++++++---------
 2 files changed, 24 insertions(+), 24 deletions(-)

diff --git a/src/algorithms/math/is-power-of-two/README.md b/src/algorithms/math/is-power-of-two/README.md
index 8253cb87..6ed1e925 100644
--- a/src/algorithms/math/is-power-of-two/README.md
+++ b/src/algorithms/math/is-power-of-two/README.md
@@ -1,14 +1,13 @@
 # Is a power of two
 
-Given a positive integer, write a function to find if it is 
+Given a positive integer, write a function to find if it is
 a power of two or not.
 
 **Naive solution**
 
 In naive solution we just keep dividing the number by two
-unless the number becomes `1` and every time we do so we
-check that remainder after division is always `0`. Otherwise
-the number can't be a power of two.
+unless the number becomes `1` and every time we do so, we
+check that remainder after division is always `0`. Otherwise, the number can't be a power of two.
 
 **Bitwise solution**
 
@@ -23,8 +22,8 @@ signed integer with a value of -128 looks like: `10000000`)
 8: 1000
 ```
 
-So after checking that the number is greater than zero, 
-we can use a bitwise hack to test that one and only one 
+So after checking that the number is greater than zero,
+we can use a bitwise hack to test that one and only one
 bit is set.
 
 ```
@@ -38,11 +37,11 @@ For example for number `8` that operations will look like:
 - 0001
   ----
   0111
-  
+
   1000
 & 0111
   ----
-  0000    
+  0000
 ```
 
 ## References
diff --git a/src/data-structures/linked-list/README.md b/src/data-structures/linked-list/README.md
index f357889d..656ad68f 100644
--- a/src/data-structures/linked-list/README.md
+++ b/src/data-structures/linked-list/README.md
@@ -5,23 +5,24 @@ _Read this in other languages:_
 [_Русский_](README.ru-RU.md),
 [_日本語_](README.ja-JP.md),
 [_Português_](README.pt-BR.md),
-[_한국어_](README.ko-KR.md)
+[_한국어_](README.ko-KR.md),
+[_Español_](README.es-ES.md),
 
-In computer science, a **linked list** is a linear collection 
-of data elements, in which linear order is not given by 
-their physical placement in memory. Instead, each 
-element points to the next. It is a data structure 
-consisting of a group of nodes which together represent 
-a sequence. Under the simplest form, each node is 
-composed of data and a reference (in other words, 
+In computer science, a **linked list** is a linear collection
+of data elements, in which linear order is not given by
+their physical placement in memory. Instead, each
+element points to the next. It is a data structure
+consisting of a group of nodes which together represent
+a sequence. Under the simplest form, each node is
+composed of data and a reference (in other words,
 a link) to the next node in the sequence. This structure
-allows for efficient insertion or removal of elements 
-from any position in the sequence during iteration. 
-More complex variants add additional links, allowing 
-efficient insertion or removal from arbitrary element 
-references. A drawback of linked lists is that access 
-time is linear (and difficult to pipeline). Faster 
-access, such as random access, is not feasible. Arrays 
+allows for efficient insertion or removal of elements
+from any position in the sequence during iteration.
+More complex variants add additional links, allowing
+efficient insertion or removal from arbitrary element
+references. A drawback of linked lists is that access
+time is linear (and difficult to pipeline). Faster
+access, such as random access, is not feasible. Arrays
 have better cache locality as compared to linked lists.
 
 ![Linked List](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)
@@ -75,7 +76,7 @@ Contains(head, value)
   return true
 end Contains
 ```
-    
+
 ### Delete
 
 ```text