diff --git a/1-js/06-advanced-functions/01-recursion/02-factorial/solution.md b/1-js/06-advanced-functions/01-recursion/02-factorial/solution.md
@@ -1,6 +1,6 @@
-By definition, a factorial `n!` can be written as `n * (n-1)!`.

-In other words, the result of `factorial(n)` can be calculated as `n` multiplied by the result of `factorial(n-1)`. And the call for `n-1` can recursively descend lower, and lower, till `1`.

```js run
function factorial(n) {
@@ -10,7 +10,7 @@ function factorial(n) {
alert( factorial(5) ); // 120
```

-The basis of recursion is the value `1`. We can also make `0` the basis here, doesn't matter much, but gives one more recursive step:

```js run
function factorial(n) {

diff --git a/1-js/06-advanced-functions/01-recursion/04-output-single-linked-list/task.md b/1-js/06-advanced-functions/01-recursion/04-output-single-linked-list/task.md
@@ -2,9 +2,9 @@ importance: 5

---

-# Output a single-linked list

-Let's say we have a single-linked list (as described in the chapter <info:recursion>):

```js
let list = {
@@ -22,8 +22,8 @@ let list = {
};
```

-Write a function `printList(list)` that outputs list items one-by-one.

-Make two variants of the solution: using a loop and using recursion.

-What's better: with recursion or without it?
diff --git a/...dvanced-functions/01-recursion/05-output-single-linked-list-reverse/solution.md b/...dvanced-functions/01-recursion/05-output-single-linked-list-reverse/solution.md
@@ -1,8 +1,8 @@
-# Using a recursion

-The recursive logic is a little bit tricky here.

-We need to first output the rest of the list and *then* output the current one:

```js run
let list = {
@@ -31,13 +31,13 @@ function printReverseList(list) {
printReverseList(list);
```

-# Using a loop

-The loop variant is also a little bit more complicated then the direct output.

-There is no way to get the last value in our `list`. We also can't "go back".

-So what we can do is to first go through the items in the direct order and remember them in an array, and then output what we remembered in the reverse order:

```js run
let list = {
@@ -71,4 +71,4 @@ function printReverseList(list) {
printReverseList(list);
```

-Please note that the recursive solution actually does exactly the same: it follows the list, remembers the items in the chain of nested calls (in the execution context stack), and then outputs them. 
diff --git a/...06-advanced-functions/01-recursion/05-output-single-linked-list-reverse/task.md b/...06-advanced-functions/01-recursion/05-output-single-linked-list-reverse/task.md
@@ -2,8 +2,8 @@ importance: 5

---

-# Output a single-linked list in the reverse order

-Output a single-linked list from the previous task <info:task/output-single-linked-list> in the reverse order.

-Make two solutions: using a loop and using a recursion.