<pre class="shiki github-dark shaku"><code>function nextRightSibling(root, target) { if (!root) return null const queue = [{ node: root, level: 0 }] while (queue.length) { const { node, level } = queue.shift() for (const child of node.children) { queue.push({ node: child, level: level + 1 }) } if (node === target) { if (!queue.length) return null const next = queue[0] return next.level === level ? next.node : null } } return null}</code></pre>

My solution 0(n)

Microsoft

Given a DOM tree and a target element, please return the next right sibling. [https://cdn.bfe.dev/bfe/img/I8ncH1ncdGaBXV3nwPH061w1MmdqNR9p_1169x546_15…