This project implements a binary tree with additional functionalities such as priority queue operations, adjacency matrix creation, and tree traversal. The project also includes a set of tools for console-based UI operations, node representation, and color management.
- Insert, delete, and search nodes in a binary tree.
- Traverse the binary tree in in-order, pre-order, and post-order.
- Display the binary tree graphically in the console.
- Create and manage a priority queue of nodes.
- Generate and print an adjacency matrix for the binary tree.
- Use ANSI escape codes for colorful console output.