<pre class="shiki github-dark shaku"><code>/** * @param {Node} root * @returns {number[]} */function traverse(root) { const coords = new Map(); function mapCoords(node, x, y, parent) { if (!node) return; coords.set(node, [x, y, parent]); mapCoords(node.left, x - 1, y -1, node); mapCoords(node.right, x + 1, y - 1, node); } mapCoords(root, 0, 0); function getOrder([,[ax,ay, pa]], [,[bx,by, pb]]) { const s1 = ax - bx; if (s1) return s1; const s2 = by - ay; if (s2) return s2; return getOrder([pa, coords.get(pa)], [pb, coords.get(pb)]) } const ordered = Array.from(coords).sort(getOrder); return ordered.map(([n]) =&gt; n.value);}</code></pre>

This is my accepted solution

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.…