Next Greater Node In Linked List LeetCode solution in JavaScript

1
var nextLargerNodes = function (head) {
2
  let arr = [];
3
  while (head) {
4
    arr.push(head.val);
5
    head = head.next;
6
  }
7
  return nextGreaterElement(arr);
8
};
9

10
function nextGreaterElement(arr) {
11
  let temp = [];
12
  let n = arr.length;
13
  let stack = [];
14
  for (let i = n - 1; i >= 0; i--) {
15
    while (stack.length != 0 && arr[stack[stack.length - 1]] <= arr[i]) {
16
      stack.pop();
17
    }
18

19
    if (stack.length == 0) {
20
      temp[i] = 0;
21
    } else {
22
      temp[i] = arr[stack[stack.length - 1]];
23
    }
24
    stack.push(i);
25
  }
26
  return temp;
27
}