Breaking News: Grepper is joining You.com. Read the official announcement!

implementation linked list

Mohammad alshraideh answered on August 13, 2022 Popularity 10/10 Helpfulness 1/10

answer implementation linked list

implementation linked list

Comment

// try to do it by your own logic ( ͡~ ͜ʖ ͡°)  don't forget to upvote the answer and search for me @mohammad alshraideh ( ͡°( ͡° ͜ʖ( ͡° ͜ʖ ͡°)ʖ ͡°) ͡°)
'use strict';'use strict';

class Node{
    constructor(data) {
        this.data =data;
        this.next =null;
    }
}
class LinkedList {
    constructor() {
        this.head = null;
        this.length =0 ;
    }

    insertFirstNode(data) {
      this.head = new Node(data, this.head);
      this.length++;
  }

  insertLastNode(data) {

    const newNode = new Node(data);

    if (!this.head) {
        this.head = newNode;
    } else {
        let currentNode = this.head;

        while (currentNode.next) {
            currentNode = currentNode.next;
        }

        currentNode.next = newNode;
    }

    this.length++;
}
insertNodeAtIndex(data, index) {
  if (this.length < index) {
      console.log("index is greater than size of list");
      return null ;
  }

  const node = new Node(data);

  // if (!this.head) {
  //     // this.head = node;
  // } else
  if (index === 0) {
      const head = this.head;
      this.head = node;
      node.next = head;
  } else {
      let previousNode;
      let currentNode = this.head;
      let indexCounter = 0;

      while (indexCounter < index) {
          previousNode = currentNode;
          currentNode = previousNode.next;

          indexCounter++;
      }

      previousNode.next = node;
      node.next = null;

      if (currentNode) {
          node.next = currentNode;
      }
  }

  this.length++;
}
getNodeAtIndex(index) {
  if (index > this.length) {
      console.log("index is greater than size of list");
      return null;
  }

  let currentNode = this.head;
  let counter = 0;

  while (counter < index) {
      currentNode = currentNode.next;
      counter++;
  }
return currentNode.data ;

}
includes(values) {
  let isIncludes = false;
  let currentNode = this.head;
  while (currentNode) {

    if (currentNode.data === values) {
      isIncludes = true;
}
      currentNode = currentNode.next;
  }
  return isIncludes;
}

removeNodeAtIndex(index) {
  if (index > this.length) {
      console.log("index is greater than size of list");
      return null;
  }

  if (!this.head) {
      console.log("List is empty");
      return null;
  }

  if (index === 0) {
      this.head = null;
  } else {
      let previousNode;
      let currentNode = this.head;
      let counter = 0;

      while (counter < index) {
          previousNode = currentNode;
          currentNode = previousNode.next;

          counter++;
      }

      if (currentNode.next) {
          previousNode.next = currentNode.next;
      }
      
  }

  this.size--;

  console.log(
      `Removed node at index(${index}) and current linked list is: })`
  );
}
clear() {
  //for each of the nodes, remove at index

  let index = 0;

  while (index < this.length) {
      console.log(`removing at index: ${index}`);
      this.removeNodeAtIndex(index);
      this.length--;
      index++;
  }
}

toString() {
  let currentNode = this.head;
  let output ='';

  while (currentNode) {
 output = ` ${output}${currentNode.data} ->  ` ;

      currentNode = currentNode.next;
  }
  console.log(`${output}null`);
}



}


module.exports=LinkedList ;

Popularity 10/10 Helpfulness 1/10 Language javascript

Source: github.com

Tags: implementation javascript linked-list

Link to this answer
Share Copy Link

Contributed on Aug 13 2022

Mohammad alshraideh

0 Answers Avg Quality 2/10

implementation linked list

Contents

More Related Answers

implementation linked list

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.