// 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)
class LinkedList {
constructor(head = null) {
this.head = head
}
}
class ListNode {
constructor(value,next=null){
this.value = value;
this.next = next;
};
}
let node1 = new ListNode(2);
let node2 = new ListNode(4);
node1.next = node2;
let list = new LinkedList(node1);
console.log(list.head.next);
/* amethod to find the maximum node value in the linkedlist*/
maxNode(list) {
let current = list.head;
let max = 0;
while (current) {
if (current.value > max) {
max = current.value
}
current = current.next;
}
return max;
}