Linked List implementation that behaves like a stack (last in, first out)

linked-list.js

const VOID = Symbol('VOID');

class LinkedItem {
  constructor(value) {
    this.value = value;
    this.next = null;
  }
}

class LinkedList {

  constructor() {
    this._length = 0;
    this.head = undefined;
  }

  get length() {
    return this._length;
  }

  push(value = VOID) {
    const newHead = new LinkedItem(value);
    newHead.next = this.head;
    this.head = newHead;

    return value !== VOID ? ++this._length : this._length;
  }

  pop() {
    if (!this._length) return undefined;

    --this._length;
    const current = this.head;
    this.head = this.head.next || undefined;
    return current.value;
  }

  peak() {
    return this._length ? this.head.value : undefined;
  }
  
  clear() {
    this.head = undefined;
    this._length = 0;
  }

  *[Symbol.iterator]() {
    let current = this.head;
    if (current === undefined) { return }

    do {
      yield current.value;
      current = current.next;
    } while (current)
  }

  toArray() {
    return Array.from(this);
  }

  static fromIterable(it) {
    const ll = new LinkedList();
    
    for (let value of it) {
      ll.push(value)
    }
    
    return ll;
  }

  static fromIterableReversed(it) {
    const ll = new LinkedList();
    const arr = Array.from(it);

    for(let i = arr.length; i--; ) {
      ll.push(arr[i])
    }

    return ll;
  }

}