Custom Binary Tree

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 structures, recursion, and algorithm analysis.

The application allows for the insertion of integer values into a binary search tree and supports retrieving the minimum and maximum values.
The project focuses on recursive logic and pointer manipulation within a tree structure to explore foundational algorithmic concepts.

Features

• Insert arbitrary int values
• Retrieve and print minimum and maximum keys
• Console demo in App.java showing insertion of a predefined data set

How to Run

Simply run App.java through your IDE (such as VS Code or IntelliJ),
or compile and run it manually:

Compile

javac -d bin src/**/*.java

Run

java -cp bin App

You should see:

Min value: 4
Max value: 84

Requires Java 17+ or compatible JDK. No external libraries needed.

To-do

• Add code comments
• Translate class and variable names to English (the course was conducted in French)

Author

Liliane Demers
Junior Software Developer
LinkedIn – Liliane Demers

License

This project is for educational purposes and not intended for production use.