A post on LinkedList says:

LinkedList allows for constant-time insertions or removals, but only sequential access of elements. In other words, `you can walk the list forwards or backwards, but grabbing an element in the middle` takes time proportional to the size of the list.

I'm not understanding what will qualify for grabbing the element in the middle?

In below piece of code, assuming `arrL` is a LinkedList that holds 50 elemnets, when counter `j` reaches 20, and program executes `arrL.get(20)`.. Does that mean program is grabbing the element in middle? Also in below program I'm just walking the list forward, isn't?

```
    for(int j=0;j<arrL.size();++j){
        arrL.get(j);
    }

```