Challenge Guide: Invert a Binary Tree

Continuing the discussion from freeCodeCamp Challenge Guide: Invert a Binary Tree:

Solution
var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));
function Node(value) {
  this.value = value;
  this.left = null;
  this.right = null;
}
function BinarySearchTree() {
  this.root = null;
  this.invert = (root = this.root)=>{
    if(!root) return null;
    [root.left,root.right] = [root.right, root.left]; //using array destructuring assignment
    this.invert(root.right);
    this.invert(root.left);
  }
}