I have checked the other topics. It looks like these issues mainly concerns C++ and Python devs but wanted to ask to have a better understanding about recursion.

*A Pascal Triangle is a triangle that consists of 1's on the edges and the sum of the upper two numbers in the interior:*

```js
        1
       1 1
      1 2 1
     1 3 3 1
    1 4 6 4 1
        .
        .
        .            

```

**Here is the code:**

```js
function pascalTriangle(row, col) {
    if (col === 0) {
        return 1;
    } else if (row === 0) {
        return 0;
    } else {
        return pascalTriangle(row - 1, col) + pascalTriangle(row - 1, col - 1);
    }
}

```

Code doesn't draw a diagram but only returns the inner most value in the triangle.

**My question is about the recursive else statement:**

how does the call stack execute else statement?
Logic behind that line actually?

***bonus if you are eager to help***:

how to get your code move on to the next line when finished executing for that specific line?