Invert Binary Tree

#javascript #leetcode

Given the root of a binary tree, invert the tree, and return its root.

Example 1:

Input: root = [4,2,7,1,3,6,9]
Output: [4,7,2,9,6,3,1]

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {TreeNode}
 */
var invertTree = function (root) {
  const invert = (root) => {
    if (root === null) {
      return;
    }
    let leftNode = root.left;
    root.left = root.right;
    root.right = leftNode;

    invert(root.left);
    invert(root.right);
  };
  invert(root);
  return root;
};