Implementing datastructures: singly linked list

data-structures_linkedlist.js

class LinkedList {
    constructor(head=null) {
        this.head = head;
        this.count = 0;
    }
    add (newData) {
        // create node
        // reference previous node to new node
        let temp = new Node(null, newData);
        let current = this.head;
        if (current === null) {
            this.head = temp
            this.count += 1
        }
        while(current.getNext() !== null) {
            current = current.getNext();
        }
        current.setNext(temp)
        this.count += 1
    }

    get (index) {
        if (index <= 0) {
            return -1
        }
        let current = this.head;
        for (let i = 1; i < index; i++) {
            current = current.getNext();
        }
        return current.getData();
    }

    size () {
        return this.count
    }

    isEmpty () {
        return this.head === null;
    }

    remove () {
        let current = this.head;
        if (current === null) {
            return -1
        }
        if (this.count === 1) {
            current = current.getNext()
            current.setNext(null)
            return
        }
        while(current.getNext().getNext() !== null) {
            current = current.getNext();
        }
        current.setNext(null)
        this.count -= 1
    }
}

class Node {
    constructor(next=null, data) {
        this.next = next
        this.data = data;
    }

    getData () {
        return this.data
    }

    getNext () {
        return this.next
    }

    setData (newData) {
        this.data = newData;
    }

    setNext (newNode) {
        this.next = newNode;
    }
}

const node = new Node(null, "node 1 data")
const linkedlist = new LinkedList(node)

linkedlist.add("node 2 data")
linkedlist.add("node 3 data")

linkedlist.remove();
console.log(linkedlist.size())

console.log(linkedlist)