C++ BST Visualizer

A simple Binary Search Tree implementation in C++ with SFML-based visualization.

Features

• Insert and remove nodes
• Search (contains)
• Inorder, preorder, and postorder traversals
• Find minimum and maximum values
• Calculate tree height
• Visualize the tree using SFML

Usage

Requirements

• C++17 or later
• SFML 3
• Make

### Build
make

### Run
make run

### Clean
make clean

### ...Project Structure...
├── include/
│   ├── bst.hpp
│   └── visual.hpp
├── src/
│   └── main.cpp
├── assets/
│   └── Roboto.ttf
├── Makefile
└── README.md