This repository demonstrates balanced binary search tree (BST) implementation in JavaScript, which includes functionalities like inserting, deleting, and traversing nodes, as well as ensuring the tree remains balanced. Both Breadth-First and Depth-First strategies were utilized for transversing the nodes. The 3 primary modules in this repository: Node, Tree, and Driver Script.
A class that represents an individual node in the binary search tree.
A class that represents the binary search tree itself, offering various methods for insertion, deletion, searching, and balancing.
A script that demonstrates the creation, traversal, unbalancing, and rebalancing of the tree.