Class LinkedList

Data-Structures/Linked-List/SinglyLinkedList.js:18–303

}

class LinkedList {
  constructor(listOfValues) {
    this.headNode = null
    this.tailNode = null
    this.length = 0

    if (listOfValues instanceof Array) {
      for (const value of listOfValues) {
        this.addLast(value)
      }
    }
  }

  // initiates the currentNode and currentIndex and return as an object
  initiateNodeAndIndex() {
    return { currentNode: this.headNode, currentIndex: 0 }
  }

  // Returns length
  size() {
    return this.length
  }

  // Returns the head
  head() {
    return this.headNode?.data ?? null
  }

  // Returns the tail
  tail() {
    return this.tailNode?.data ?? null
  }

  // Return if the list is empty
  isEmpty() {
    return this.length === 0
  }

  // add a node at last it to linklist
  addLast(element) {
    // Check if its the first element
    if (this.headNode === null) {
      return this.addFirst(element)
    }
    const node = new Node(element)
    // Adding node at the end of the list and increase the length
    this.tailNode.next = node
    this.tailNode = node
    this.length++
    return this.size()
  }

  // add a node at first it to linklist
  addFirst(element) {
    const node = new Node(element)
    // Check if its the first element
    if (this.headNode === null) {
      this.tailNode = node