<pre class="shiki github-dark shaku"><code>// This is the class for the node// you can use this directly as it is bundled with your code// class Node {// value: number// left: null | Node// right: null | Node// constructor(val) {// this.value = val// this.left = null// this.right = null// }// }/** * @param {Node} root * @returns {number[]} */function traverse(root) { // your code here if(!root){ return [] } const columnMap = new Map(); let min = Infinity; let max= -Infinity let queue = [[root,0]] while(queue.length &gt; 0) { let count = queue.length while(count-- &gt; 0) { const [node,index] = queue.shift() if(columnMap.has(index)){ columnMap.get(index).push(node.value); } else { columnMap.set(index,[node.value]) } min = Math.min(min, index) max = Math.max(max, index) if(node.left){ queue.push([node.left, index-1]) } if(node.right){ queue.push([node.right, index+1]) } } queue.sort((a,b)=&gt;a[1]-b[1]) } let length = -min + max +1 const result = new Array(length) for(const [rawIndex,value] of columnMap.entries()){ result[rawIndex - min] = value } return result.flat()}const root = new Node(1);root.left = new Node(2);root.left.left = new Node(4);root.left.left.left = new Node(6);root.left.left.right = new Node(7);root.left.left.right.right = new Node(9);root.right = new Node(3);root.right.right = new Node(5);root.right.right.left = new Node(8);root.right.right.left.left = new Node(10);console.log(traverse(root));</code></pre>

accepted code

Traverse a binary tree vertically from left to right, from top to bottom, the binary tree contains positive integers as node values. [https://cdn.bfe.…