Code style fixes.

slyvic · Dec 17, 2020 · e220450 · e220450
1 parent de1cc0b
commit e220450
Show file tree

Hide file tree

Showing 3 changed files with 4 additions and 6 deletions.
diff --git a/src/algorithms/linked-list/traversal/README.md b/src/algorithms/linked-list/traversal/README.md
@@ -7,7 +7,7 @@ The task is to traverse the given linked list in straight order.
 
 For example for the following linked list:
 
-![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)
+![Singly linked list](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)
 
 The order of traversal should be:
 

diff --git a/src/algorithms/linked-list/traversal/README.ru-RU.md b/src/algorithms/linked-list/traversal/README.ru-RU.md
@@ -4,7 +4,7 @@
 
 Например, для следующего связного списка:
 
-![](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)
+![Singly linked list](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)
 
 Порядок обхода будет такой:
 

diff --git a/src/data-structures/linked-list/__test__/LinkedList.test.js b/src/data-structures/linked-list/__test__/LinkedList.test.js
@@ -227,20 +227,18 @@ describe('LinkedList', () => {
     let node = linkedList.find({ value: 3 });
     expect(node.value).toBe(4);
 
-    node = linkedList.find({ callback: value => value < 3 });
+    node = linkedList.find({ callback: (value) => value < 3 });
     expect(node.value).toBe(1);
   });
 
   it('should convert to array', () => {
     const linkedList = new LinkedList();
-
     linkedList.append(1);
     linkedList.append(2);
     linkedList.append(3);
-
     expect(linkedList.toArray().join(',')).toBe('1,2,3');
   });
-  
+
   it('should reverse linked list', () => {
     const linkedList = new LinkedList();