invert-binary-tree

var preorderTraversal = function(root, res = []) {
  if (!root) {
    return res;
  }
  const { val, left, right } = root;
  res.push(val);
  preorderTraversal(left, res);
  preorderTraversal(right, res);
  return res;
};