Simple self-balancing binary search tree on C/C++
- Tree's nodes is a data structure with two member ( value and key)
- This program have a small menu, which by default start working with start of program
- Menu allows us to manage bin-tree with help of three actions( add node, delete node, print all nodes)
- All data is stored in a txt-file (in a current folder with a program) that is called a "phonebook"
- Txt-file will created automatically, when you're add first node