How to create linked lists for every depth of a binary tree in JavaScript

function listOfDepths(root) {
    
    if (!root) return;
    
    const result = [];
    const queue = [];
    
    queue.push(root);
    
    let level = 0;
    
    while (queue.length) {
      const treeNode = queue.shift();
      const list = new List(treeNode.value);   
      
      if (treeNode.left) {
        queue.push(treeNode.left);
      }
      
      if (treeNode.right) {
        queue.push(treeNode.right)
      }
      
      for (let i = 2; i <= Math.pow(2, level) && queue.length; i++) {
        const tNode = queue.shift();
        
        if (tNode.left) {
          queue.push(tNode.left);
        }
      
        if (tNode.right) {
          queue.push(tNode.right)
        }
        
        list.addToTail(tNode.value);
      }
      
      result.push(list)
      level++;
    }
    
    return result;
  }
function List(value) {
  this.value = value;
  this.next = null;
}
List.prototype.addToTail = function(value) {
  let node = this;
  
  while (node.next) {
    node = node.next;  
  }
  
  node.next = new List(value);
}