Both recursive and iterative solution included below. The iterative is just the recursive one, but using a stack.
<pre class="shiki github-dark shaku"><code>function getHeight(tree) { let treeHeight = 0; // Recursive procedure function recursive(tree, height) { if (!tree) return; if (tree.children.length === 0) { height++; treeHeight = Math.max(height, treeHeight); return; } for (let node of tree.children){ recursive(node, height + 1); } } // iterative procedure function iterative(tree) { if (!tree) return; let stack = []; stack.push({node: tree, height: 0}); while(stack.length) { let top = stack.pop(); if (top.node.children.length === 0) { top.height += 1; treeHeight = Math.max(top.height, treeHeight); } else { for(let node of top.node.children) { stack.push({node, height: top.height + 1}); } } } } // recursive(tree, 0); OR iterative(tree); return treeHeight;}</code></pre>

BOTH RECURSIVE AND ITERATIVE PROCEDURE - CREATED AS CLOSURE INSIDE GETHEIGHT

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…