<h1>DFS</h1>
<pre class="shiki github-dark shaku"><code>/** * @param {HTMLElement | null} tree * @return {number} */function getHeight(tree) { let height = 0; if (!tree) return height; for (let item of tree.children) { height = Math.max(height, getHeight(item)); } return height + 1;}</code></pre>
<h1>BFS</h1>
<pre class="shiki github-dark shaku"><code>/** * @param {HTMLElement | null} tree * @return {number} */function getHeight(tree) { let height = 0; if (!tree) return height; const arr = [tree]; while (arr.length) { height++; const size = arr.length; for (let i = 0; i &lt; size; i++) { const firstNode = arr.shift(); arr.push(...firstNode.children) } } return height;}const div = document.createElement('div')div.innerHTML =`&lt;div&gt; &lt;p&gt; &lt;button&gt;Hello&lt;/button&gt; &lt;/p&gt;&lt;/div&gt;&lt;p&gt; &lt;span&gt;World!&lt;/span&gt;&lt;/p&gt;`console.log(getHeight(div));</code></pre>

DFS and BFS solution

Height of a tree is the maximum depth from root node. Empty root node have a height of 0. If given DOM tree, can you create a function to get the heig…