LinkedList class, add To Tail method, intersection LinkLists - Node.js Data Structure

Node.js examples for Data Structure:List

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

Description

LinkedList class, add To Tail method, intersection LinkLists

Demo Code


// Linked List//from   ww w  .j  ava  2s  .co m
var LinkedList = function () {
  this.head = null;
  this.tail = null;
};

LinkedList.prototype.addToTail = function (val) {
  var newNode = this.makeNode(val);

  if (!this.tail) {
    this.head = newNode;
    this.tail = newNode;
  } else {
    this.tail.next = newNode;
    this.tail = newNode
  }
};

LinkedList.prototype.makeNode = function(val){
  var newNode = {
    value: val,
    next: null    
  }
  return newNode;
};

// intersection of two lists
var intersectionLinkLists = function (listOne, listTwo) {
  // make a hash of the first list
  var listOneHash = {};
  var currentNode = listOne.head

  while(currentNode.next) {
    if !(listOneHash[currentNode.value]) {
      listOneHash[currentNode] = true;
    }
  }

  // iterate through second list
  var currentNode = listTwo.head

  while(currentNode.next) {
    if (listOneHash[currentNode.value]) {
      return currentNode.value;
    }
  }
}

// Test

// make two linked lists
var listOne = new LinkedList();
var listTwo = new LinkedList();

console.log(listOne);
console.log(listTwo);

Related Tutorials