#Binary Search Tree

This JavaScript module provides a complete implementation of a Binary Search Tree (BST) with various useful operations.

Features

• Build a balanced BST from an array

• Insert new values

• Delete nodes

• Search for a specific value

• Traverse the tree (level-order, pre-order, in-order, post-order)

• Calculate height and depth of nodes

• Check if the tree is balanced

• Rebalance the tree