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

JavaScript: linked-lists

Frontend Expert answered on February 7, 2022 Popularity 9/10 Helpfulness 2/10

answer JavaScript: linked-lists

JavaScript: linked-lists

Comment

// A balanced linked list in JavaScript
function BalancedLinkedList() {
    this.head = null;
    this.tail = null;

    function Node(data) {
        this.data = data;
        this.next = null;
    }

    this.add = function(data) {
        var newNode = new Node(data);

        if (this.head === null) {
            this.head = newNode;
            this.tail = newNode;
        } else {
            var currentNode = this.head;

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

            currentNode.next = newNode;
            this.tail = newNode;
        }
    };

    this.remove = function(data) {
        var currentNode = this.head;
        var previousNode = null;

        while (currentNode !== null && currentNode.data !== data) {
            previousNode = currentNode;
            currentNode = currentNode.next;
        }

        if (currentNode === null) {
            return false;
        } else if (previousNode === null) {
            this.head = currentNode.next;
        } else {
            previousNode.next = currentNode.next;
        }

        return true;
    };
}

// A hash table in JavaScript
function HashMap() {
    this.table = {};

    this.add = function(key, value) {
        this.table[key] = value;
    };

    this.get = function(key) {
        return this.table[key];
    };

    this.remove = function(key) {
        delete this.table[key];
    };
}

// A linked list with a sentinel node in JavaScript
function LinkedListWithSentinel() {
    this.sentinel = new Node(null);
    this.head = this.sentinel;
    this.tail = this.sentinel;

    function Node(data) {
        this.data = data;
        this.next = null;
    }

    this.add = function(data) {
        var newNode = new Node(data);

        this.tail.next = newNode;
        this.tail = newNode;
    };

    this.remove = function(data) {
        var currentNode = this.head.next;
        var previousNode = this.head;

        while (currentNode !== null && currentNode.data !== data) {
            previousNode = currentNode;
            currentNode = currentNode.next;
        }

        if (currentNode === null) {
            return false;
        } else {
            previousNode.next = currentNode.next;
        }

        return true;
    };
}

Popularity 9/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript

Link to this answer
Share Copy Link

Contributed on Jun 06 2023

Frontend Expert

0 Answers Avg Quality 2/10

Closely Related Answers

linked list javascript

Comments(1)

// Linked Lists of nodes
class Node {
  constructor(value) {
    this.value = value;
    this.next = null;
  }
}

class LinkedList {
  constructor() {
    this.head = null;
  }

  // Add a value at beginning of list
  addStart(value) {
    const node = new Node(value);
    node.next = this.head;
    this.head = node;
  }

  // Add a value at end of list
  addEnd(value) {
    const node = new Node(value);
    let curr = this.head;
    if (curr == null) {
      this.head = node;
      return;
    }

    while (curr !== null && curr.next !== null) {
      curr = curr.next;
    }

    curr.next = node;
  }
}

const list = new LinkedList();
list.addStart(1);
list.addStart(2);
list.addEnd(3);

console.log(list.head.value); // 2 (head of list)

Popularity 10/10 Helpfulness 5/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Feb 07 2022

Wissam

0 Answers Avg Quality 2/10

Linked List javascript

Comment

class LinkedList {
  constructor() {
    this.nodes = [];
  }

  get size() {
    return this.nodes.length;
  }

  get head() {
    return this.size ? this.nodes[0] : null;
  }

  get tail() {
    return this.size ? this.nodes[this.size - 1] : null;
  }

  insertAt(index, value) {
    const previousNode = this.nodes[index - 1] || null;
    const nextNode = this.nodes[index] || null;
    const node = { value, next: nextNode };

    if (previousNode) previousNode.next = node;
    this.nodes.splice(index, 0, node);
  }

  insertFirst(value) {
    this.insertAt(0, value);
  }

  insertLast(value) {
    this.insertAt(this.size, value);
  }

  getAt(index) {
    return this.nodes[index];
  }

  removeAt(index) {
    const previousNode = this.nodes[index - 1];
    const nextNode = this.nodes[index + 1] || null;

    if (previousNode) previousNode.next = nextNode;

    return this.nodes.splice(index, 1);
  }

  clear() {
    this.nodes = [];
  }

  reverse() {
    this.nodes = this.nodes.reduce(
      (acc, { value }) => [{ value, next: acc[0] || null }, ...acc],
      []
    );
  }

  *[Symbol.iterator]() {
    yield* this.nodes;
  }
}

Popularity 9/10 Helpfulness 1/10 Language javascript

Source: www.30secondsofcode.org

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Jan 09 2024

Himanshu Jangid

0 Answers Avg Quality 2/10

JavaScript: linked-lists

Contents

More Related Answers

JavaScript: linked-lists

Closely Related Answers

linked list javascript

Linked List javascript

Grepper

Documentation

Social

Legal

Contact

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