Binary Search Tree Visualizer

An interactive visualizer that turns Binary Search Tree operations into a practical graphical experience.

Project summary

Binary Search Tree Visualizer was developed for UNED's Data Structures course. The application makes it easier to observe how a Binary Search Tree changes as nodes are inserted, deleted, or queried.

The project combines recursive algorithms, data validation, object-oriented programming, and a Java Swing interface to turn foundational data-structure concepts into an interactive experience.

What it offers

Node insertion with duplicate ID validation.
Deletion of leaf nodes and nodes with one or two children.
Node search and stored-information lookup.
In-order, pre-order, and post-order traversals.
Graphical representation of the current tree structure.

Technologies

Java
Java Swing
Apache NetBeans