<pre class="shiki github-dark shaku"><code>/** * @param {HTMLElement} root * @param {HTMLElement} target * @return {HTMLElemnt | null} */function nextRightSibling(root, target) { const queue = [root]; while (queue.length &gt; 0) { const node = queue.shift(); if (node === target) { return queue.shift() ?? null; } queue.push(...node.children) } return null;}</code></pre>

Simple BFS

Microsoft

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