This project provides a simple implementation of a Binary Search Tree (BST) in Java. It includes basic operations such as insertion, deletion, searching, and tree traversal (in-order, pre-order, ...

A lightweight Java implementation of a binary search tree written from scratch—no Java collections used. Built as part of the Algorithms and Programming Models course to deepen understanding of tree ...