What is your hint or solution suggestion?
Solution:
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;
// Only change code below this line
this.inorder = function(root=this.root, arr = []) {
if(!root) return null;
this.inorder(root.left, arr);
arr.push(root.value);
this.inorder(root.right, arr);
return arr;
}
this.preorder = function(root=this.root, arr = []) {
if(!root) return null;
arr.push(root.value);
this.preorder(root.left, arr);
this.preorder(root.right, arr);
return arr;
}
this.postorder = function(root=this.root, arr = []) {
if(!root) return null;
this.postorder(root.left, arr);
this.postorder(root.right, arr);
arr.push(root.value);
return arr;
}
// Only change code above this line
}
Challenge: Use Depth First Search in a Binary Search Tree
Link to the challenge: