BST Construction

Construct a Binary Search Tree and implement that implementsinsert(), search(), traverse() and delete() methods.

Binary Search Tree is a node-based binary tree data structure which has the following properties:

• The left subtree of a node contains only nodes with keys lesser than the node's key.
• The right subtree of a node contains only nodes with keys greater than the node's key.
• The left and right subtree each must also be a binary search tree.

Tasks

1. Create a Binary Search Tree class.
2. Create an insert() method - that inserts a new node in the Binary Search Tree.
3. Create an delete() method - that deletes a new node from the Binary Search Tree.
4. Create a traverse() method - that traverses the Binary Search Tree in preorder traversal.
5. Create a search() method - that searches for a target value in the Binary Search Tree. If the element is present, return true. Otherwise, return false.

Example

const tree = new BST(10);
tree.insert(5);
tree.insert(15);
tree.insert(2);
tree.insert(5);
tree.insert(13);
tree.insert(22);
tree.insert(1);
tree.insert(14);
tree.traverse();

Output:
10 5 2 1 5 15 13 14 22