Username And Password Manager demo in C/C++

This is a project that is aimed at designing a an improved login system that would allow eligible users to access the system. There will be a file that contains usernames against their secret password that must be matching when logging in. The system will read the matching usernames and passwords. After logging into the system, there will be options to add new user, delete user, verify user, print user and quit. The program will be implemented using C++ programing languages using two classes BSTnode and BinarySearchTree. A binary search tree (BST), also known as an ordered binary tree, is a node-based data structure in which each node has no more than two child nodes. Each child must either be a leaf node or the root of another binary search tree. The left sub-tree contains only nodes with value less than the parent node. The right sub-tree contains only nodes with values greater than the parent node. This will search for the usernames with their corresponding password. It is a routine, when the whole structure of BST is put into two classes. Main class BinarySearchTree is a public interface and BSTNode mean for private use inside the main class. This division is necessary, because some operations, like removal, may result in an empty tree, which means that tree even does not have a root node.

IDE : Atom, Code::Blocks, Visual Studio Code (VS Code), Dev C++, NetBeans, CodeLite, CLion, QtCreator, Xcode Compilers for C++ : GCC compiler on Windows

1. laptop/desktop. 2. minimum 1GB RAM. 3. minimum 100GB HDD.