BST_implementation.js

// BST implementation in Javascript

class Node{
    constructor(data) {
       this.data = data;
       this.left = null;
       this.right = null;
    };
 };

 class BinarySearchTree{
    constructor(){
       this.root = null;
    }
    insert(data){
       var newNode = new Node(data);
       if(this.root === null){
          this.root = newNode;
       }else{
          this.insertNode(this.root, newNode);
       };
    };
    insertNode(node, newNode){
       if(newNode.data < node.data){
          if(node.left === null){
             node.left = newNode;
          }else{
             this.insertNode(node.left, newNode);
          };
       } else {
          if(node.right === null){
             node.right = newNode;
          }else{
             this.insertNode(node.right,newNode);
          };
       };
    };
 };

function print_f(root) {
   if (root === null) {
      return false;
   }
  console.log(root.data);

  print_f(root.left);
  print_f(root.right);
}
 
 const BST = new BinarySearchTree();
 BST.insert(1);
 BST.insert(2);
 BST.insert(3);


 print_f(BST.root);

 //Output :
 // 1 2 3