BST all opertions in js

BST

all operations

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

class BinarySearchTree {
  constructor() {
    this.root = null;
  }

  // Insert a node
  insert(data) {
    const 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);
      }
    }
  }

  // In-order traversal with sum calculation
  inorderAndSum(node) {
    if (node !== null) {
      let leftSum = this.inorderAndSum(node.left);
      let rightSum = this.inorderAndSum(node.right);
      return node.data + leftSum + rightSum;
    }
    return 0;
  }

  // Get the root node
  getRootNode() {
    return this.root;
  }
}

// Usage example
const bst = new BinarySearchTree();
bst.insert(15);
bst.insert(25);
bst.insert(10);
bst.insert(7);
bst.insert(22);
bst.insert(17);
bst.insert(13);
bst.insert(5);
bst.insert(9);
bst.insert(27);

const root = bst.getRootNode();

const sum = bst.inorderAndSum(root);
console.log("Sum of all elements in the BST:", sum);