LinkedList, add to tail, remove head - Node.js Data Structure

Node.js examples for Data Structure:List

  1. HOME
  2. Node.js
  3. Data Structure
  4. List

Description

LinkedList, add to tail, remove head

Demo Code


var LinkedList = function() {
  this.head = null;/*from   www  . j  a va2s . co m*/
  this.tail = null;
};

LinkedList.prototype.addToTail = function(value) {
  var newNode = this.makeNode(value);
  
  if(this.head === null) {
    this.head = newNode;
    return;
  } 
  
  var head = this.head;
  
  //traverses through the linkedlist, starting with the head
  var subRoutine = function(node) {
    if(node.next === null) {
      node.next = newNode;
    } else {
      subRoutine(node.next);
    }
    
  };
  subRoutine(head);
  
  //the tail will always be the last node, or the newly created node
  this.tail = newNode;
};

LinkedList.prototype.removeHead = function() {
  var nextNode = this.head.next;
  this.head = nextNode;
};

LinkedList.prototype.contains = function(target) {
  var head = this.head;
  
  var subRoutine = function(node) {
    if(node.value === target) {
      return true;
    } else if (node.next !== null){
      return subRoutine(node.next);
    }
    return false;
  };
  return subRoutine(head);
  
};


LinkedList.prototype.makeNode = function(value) {
  var node = {};
  node.value = value;
  node.next = null;
  return node;
  
};



var linklist = new LinkedList();
linklist.addToTail(5);
linklist.addToTail(6);
linklist.addToTail(7);
linklist.addToTail(8);
console.log(linklist.head.value);
console.log(linklist.head.next.value);
console.log(linklist.head.next.next.value);
console.log(linklist.head.next.next.next.value);
console.log(linklist.tail.value);

linklist.removeHead();
console.log(linklist.head.value);
console.log(linklist.head.next.value);
console.log(linklist.head.next.next.value);

console.log(linklist.contains(6));

Related Tutorials