Use Depth First Search in a Binary Search Tree

What is your hint or solution suggestion?

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;
  // Only change code below this line
  var inorder = [];
  var preorder = [];
  var postorder = [];
  this.inorder = function(root = this.root){
    if(!root){
      return null
    }

    this.inorder(root.left);
    inorder.push(root.value)
    this.inorder(root.right);
    return inorder
  }

  this.preorder = function(root = this.root){
    if(!root){
      return null
    }

    preorder.push(root.value)
    this.preorder(root.left);
    this.preorder(root.right);
    return preorder
  }

  this.postorder = function(root = this.root){
    if(!root){
      return null
    }
    
    this.postorder(root.left);
    this.postorder(root.right);
    postorder.push(root.value);

    return postorder
  }
  // Only change code above this line
}

Challenge: Use Depth First Search in a Binary Search Tree

Link to the challenge:

HI @gavinmacken87!

Welcome to the forum!

Thank you, for your contribution. For future contributions, please wrap your solution within :

[details]
```
code goes here...
```
[/details]

Also, provide all of the necessary code to pass the challenge.

Also, when you enter a code block into a forum post, please precede it with a separate line of three backticks and follow it with a separate line of three backticks to make it easier to read.

You can also use the “preformatted text” tool in the editor ( </> ) to add backticks around text.

See this post to find the backtick on your keyboard.
Note: Backticks (`) are not single quotes (’).