1class Node {
2  constructor(data) {
3    this.data = data;
4    this.next = null;
5  }
6}
7
8class LinkedList {
9  constructor() {
10    this.head = null;
11  }
12  addLast(val) {
13    let newNode = new Node(val);
14    if (!this.head) {
15      this.head = newNode;
16      return;
17    }
18
19    let current = this.head;
20    while (current.next) {
21      current = current.next;
22    }
23    current.next = newNode;
24  }
25
26  reverse() {
27    let prev = null;
28    let current = this.head;
29    while (current) {
30      let next = current.next;
31      current.next = prev;
32      prev = current;
33      current = next;
34    }
35    this.head = prev;
36  }
37
38  deleteGreater() {
39    this.reverse();
40    let current = this.head;
41    let max = current.data;
42    let prev = null;
43
44    while (current && current.next) {
45      if (current.next.data < max) {
46        current.next = current.next.next;
47      } else {
48        max = current.next.data;
49        prev = current;
50        current = current.next;
51      }
52    }
53    this.reverse();
54  }
55
56  print() {
57    let current = this.head;
58    while (current) {
59      console.log(current.data + "->");
60      current = current.next;
61    }
62  }
63}
64const linkedlist = new LinkedList();
65
66linkedlist.addLast(12);
67linkedlist.addLast(15);
68linkedlist.addLast(10);
69linkedlist.addLast(11);
70linkedlist.addLast(5);
71linkedlist.addLast(6);
72linkedlist.addLast(2);
73linkedlist.addLast(3);
74linkedlist.print();
75console.log("<=======>");
76linkedlist.deleteGreater();
77linkedlist.print();
78