LinkedList

insert(any, i): void

Inserts an element after $i$-th element, indexing from $0$. If $i \geq \text{size()}$, inserts elem at the end of list.

push(any): void

Inserts an element at the end of list.

reverse(): void

Reverses the list itself.

remove(any): void

Removes the first node with such element, if no such node, keeps linkedlist unchanged.