Implement this code in the (c++ program only) which accepts simple entries such as name, and phone number, and stores the address book entries in a form of a Binary tree by inserting the entries, you will have to modify the current implementation to accept strings. Then adjust the entries and save the new info in the table and eventually in the file. Upon exit: Save tree info (will be already sorted) in the phonebook file. Upon startup, load the stored phone info from the phonebook file. Then display phone numbers info in sorted order, limit the entries to a few

Here is BinaryTree.h:

Here is IntBinaryTree.h

Here is InBinaryTree.cpp:

Here is the main.cpp:

// The displaypreOrder member function displays the values // in the subtree pointed to by nodePtr, via preorder traversal. template // // The displaypostorder member function displays the values // in the subtree pointed to by nodePtr, via postorder traversal.* / / / template Gvoid BinaryTreesTy: :displayPostOrder(Treekode* nodePtr) const { if (nodeptr) \{ displayPostorder(nodePtr->left); displayPostorder(nodePtr->right); cout value endl; j [? \#endif