CodingInterviewProblems/LeetCode/JavaScript/invertTree.js at master · vale-c/CodingInterviewProblems · GitHub

26 lines (22 loc) · 577 Bytes

/**

* Definition for a binary tree node.

* function TreeNode(val) {

* this.val = val;

* this.left = this.right = null;

* }

/**

* @param {TreeNode} root

* @return {TreeNode}

var invertTree = function (root) {

if (root === null) return null;

let tmp = root.left;

root.left = invertTree(root.right);

root.right = invertTree(tmp);

return root;

};

/**

* Time Complexity: O(N), where N is the number of nodes in the tree, as each node is visited once.

* Space Complexity: O(H), where H is the height of the tree, due to the recursion stack.

Expand file tree