A basic social network system using binary tree data structure. Basically what you can do with this code;
Users have; ID, name, friends
You can; Add users to the binary tree either from a file or console. Remove users from binary tree without (almost) destroying it. Check if a user with given ID exists in the binary tree. Find the friends of user with given ID. See the number of users. Print any user's left and right subtree -excluding the root itself- See any user with a greater ID than the given ID. Print the tree in order (left-node-right).
You can't; Remove a user and then check it's friends. Find the meaning of the life. Make cool rainbows. Simply walk into Mordor. See me. Make cool double rainbows.