<pre class="shiki github-dark shaku"><code>// recursion/** * @param {HTMLElement | null} tree * @return {number} */function getHeight(tree) { if(!tree) { return 0; } const children = [...tree.childNodes].filter(v=&gt;v.nodeType===1); // html tag only return 1 + (children.length&gt;0 ? Math.max(...children.map(getHeight)) : 0)}// iterate/** * @param {HTMLElement | null} tree * @return {number} */function getHeight(tree) { if(!tree) { return 0; } let queue = [tree]; let ans = 0; while(queue.length&gt;0) { const tmpQueue = []; ans++; while(queue.length&gt;0) { const node = queue.shift(); tmpQueue.push(...[...node.childNodes].filter(v=&gt;v.nodeType===1)); // html tag only } queue = tmpQueue; } return ans;}</code></pre>

recursion and iterate 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…