Let us understand how we're going to create and represent a binary search tree in Javascript. We'll first need to create the class BinarySearchTree and define a property Node on it.
Example
class BinarySearchTree {
constructor() {
// Initialize a root element to null.
this.root = null;
}
}
BinarySearchTree.prototype.Node = class {
constructor(data, left = null, right = null) {
this.data = data;
this.left = left;
this.right = right;
}
};We've simply created a class representation of our BST class. We'll fill this class in as we proceed to learn functions that we'll add to this structure.