<pre class="shiki github-dark shaku"><code>// This is the type for the node// type Node = null | {// value: number// left: Node// right: Node// }/** * @param {Node} node * @returns {Node} */function invert(node) { // your code here if(!node) return null; let temp = node.right; node.right = node.left; node.left = temp; invert(node.left); invert(node.right)}</code></pre>

Time Complexity - O(n), Space Complexity - O(h), Recursive Solution

Google

Can you invert a binary tree and get an offer from Google? > Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert …