#include "p1a.h"
#include <iostream.h>

int main()
{
  E_System E;
  E.User_Interface();
  return 0;
}

/******************************************/
/**************************************************************************
* This the header file for the Emergency Contact System Program
* ************************************************************************/
struct Node
{
  char * Position;
  char * F_Name;
  char * L_Name;
  char * Address;
  char * City;
  char * State;
  int Zip;
  char * Phone;
  char * Email;

  Node * Next;
  Node * LChild, * RChild;
};

/*************************************************************************/
class LL
{
  public:
    LL();
    ~LL();
    void LL_Insert(Node *& treeNode);
    void LL_ListInsert(); /* This is called from the User Interface to append contacts to a user account*/
    void LL_Delete();
    void LL_Display();
    bool LL_Is_Empty() const;

  protected:
    Node * Head;
};

/************************************************************************/
class BST : public LL
{
  public:
    BST();
    ~BST();
    void BST_Insert();
    void BST_InsertContact(Node *& treePtr, Node *& treePtr, bool & Success);
/*    void BST_Remove(); */
    void BST_DisplayInorder();
    void BST_Inorder(Node * treePtr);
    bool BST_Is_Empty() const;
    void BST_ProcessLeftmost(Node *& treePtr, Node *& treePtr);
    void BST_Visit(Node * treePtr);
    void BST_InorderDel(Node * treePtr);
    void BST_Del_Visit(Node * treePtr);
    void BST_DestroyTree(Node *& treePtr);
    void BST_Delete();
    void BST_DeleteContact(Node *& treePtr, Node *& treePtr, bool & Success);
    void BST_DeleteContactInfo(Node *& treePtr);
    void BST_Retrieve();
    void BST_RetrieveContact(Node *& treePtr, Node *& treePtr, bool & Success);

  protected:
    Node * Root;
};

/*******************************************/
class E_System : public BST
{
  public:
    E_System();
    ~E_System();
    void Call_E_Contact();
    void Call_Alt_E_Contact();
    void Email_E_Contact();
    void Email_Alt_E_Contact();
    void User_Interface();

  private:
    char * Emergency;          /* I'm not sure about this field */
};

/********************************************/
E_System::E_System()
{
  Emergency = NULL;
}

E_System::~E_System()
{
  delete [] Emergency;
}

void E_System::Call_E_Contact()
{
  BST_Retrieve();
  cout << "Calling Emergency Contact..." << endl;

}

void E_System::Call_Alt_E_Contact()
{
  cout << "Calling Alternate Emergency Contacts..." << endl;
}

void E_System::Email_E_Contact()
{
  cout << "Emailing Emergency Contact..." << endl;
}

void E_System::Email_Alt_E_Contact()
{
  cout << "Emailing Alternate Emergency Contacts..." << endl;
}

void E_System::User_Interface()
{
  E_System E;
  int choice;
  char response = 'y';


  do
  {
  cout << "***************************" << endl;
  cout << "*                  User Menu           *" << endl;
  cout << "***************************" << endl;
  cout << "1) Add a new account to the emergency contact program" << endl;
  cout << "2) Add a contact to an existing account" << endl;
  cout << "3) Delete an account from the emergency contact program" << endl;
  cout << "4) Delete a contact from an existing account" << endl;
  cout << "5) Display all contact accounts in the tree" << endl;
  cout << "6) Display all contacts within an emergency contacts list" << endl;
  cout << "7) Call an emergency contact" << endl;
  cout << "8) Call alternate emergency contacts" << endl;
  cout << "9) Email an emergency contact" << endl;
  cout << "10) Email alternate emergency contacts" << endl;
  cout << "11) Quit" << endl;
  cin >> choice;

  switch(choice)
  {
    case 1:
        E.BST::BST_Insert();
        break;
    case 2:
/*        E.LL::LL_ListInsert();  */
        break;
    case 3:
        E.BST::BST_Delete();
        break;
    case 4:
        E.LL::LL_Delete();
        break;
    case 5:
        E.BST_DisplayInorder();
        break;
    case 6:
        E.BST_Retrieve();
        break;
    case 7:
        E.Call_E_Contact();
        break;
    case 8:
        E.Call_Alt_E_Contact();
        break;
    case 9:
        E.Email_E_Contact();
        break;
    case 10:
        E.Email_Alt_E_Contact();
        break;
    case 11:
        cout << "Thanks for using the program." << endl;
        break;
    default:
        cout << "Error in choice selection." << endl;
        break;
  }

  cout << "Enter another selection? (y-yes, n-no)" << endl;
  cin >> response;
  }while(response == 'y');
}
/*****************MY ATTEMPTS AT INSERTION*********************/

void LL::LL_Insert(Node *& treeNode)
{
  LL List;
  List.Head = treeNode;    /* treeNode has the Root's data in it */
  char response = 'y';

  while(response == 'y')
  {
  char temp[75];
  Node * CurrPtr;
  CurrPtr = new Node;

  cin.get();
  cout << "Enter contact's first name: " << endl;
  cin.get(temp, 30, '\n');
  CurrPtr->F_Name = new char[strlen(temp) + 1];
  strcpy(CurrPtr->F_Name, temp);

  cin.get();
  cout << "Enter contact's last name: " << endl;
  cin.get(temp, 30, '\n');
  CurrPtr->L_Name = new char[strlen(temp) + 1];
  strcpy(CurrPtr->L_Name, temp);


  if (List.Head == NULL)
  {
    cout << "made it into the head node...inserting here..." << endl;
    List.Head = new Node;
    List.Head->Next = NULL;
    List.Head->LChild = NULL;
    List.Head->RChild = NULL;

    List.Head->F_Name = new char[strlen(CurrPtr->F_Name) + 1];
    strcpy(List.Head->F_Name, CurrPtr->F_Name);

    List.Head->L_Name = new char[strlen(CurrPtr->L_Name) + 1];
    strcpy(List.Head->L_Name, CurrPtr->L_Name);
  }
  else
  {
    cout << "head of this list is not empty...searching for insertion point..." << endl;
    Node * newPtr = List.Head;
    Node * prevPtr = NULL;
    while (newPtr != NULL)
    {
      cout << "made it into the while loop...looping..." << endl;
      prevPtr = newPtr;
      cout << "just set prevPtr = newPtr..." << endl;
      newPtr = newPtr->Next;
      cout << "just set newPtr = newPtr->Next..." << endl;
    }
    cout << "made it out of the while loop..." << endl;
    Node * newNode;
    newNode = new Node;
/*    newNode->Next = NULL;  */
    newNode->LChild = NULL;
    newNode->RChild = NULL;

    newNode->F_Name = new char[strlen(CurrPtr->F_Name) + 1];
    strcpy(newNode->F_Name, CurrPtr->F_Name);

    newNode->L_Name = new char[strlen(CurrPtr->L_Name) + 1];
    strcpy(newNode->L_Name, CurrPtr->L_Name);

    if (prevPtr == NULL)
    {
      newNode->Next = newPtr;
      List.Head = newNode;
    }
    else
    {
      newNode->Next = newPtr;
      prevPtr->Next = newNode;
    }
  }
  cout << "Do you wish to add more contacts to this emergency account? (y-yes, n-no)";
  cout << endl;
  cin >> response;
  }
}


/********BINARY SEARCH TREE INSERTION ATTEMPT********/
void BST::BST_Insert()
{
  Node * treePtr;
  treePtr = new Node;
  treePtr->LChild = NULL;
  treePtr->RChild = NULL;
  treePtr->Next = NULL;
  bool Success;
  char response = 'y';

  char temp[75];

  cin.get();
  cout << "Enter contact's first name: " << endl;
  cin.get(temp, 30, '\n');
  treePtr->F_Name = new char[strlen(temp) + 1];
  strcpy(treePtr->F_Name, temp);

  cin.get();
  cout << "Enter contact's last name: " << endl;
  cin.get(temp, 30, '\n');
  treePtr->L_Name = new char[strlen(temp) + 1];
  strcpy(treePtr->L_Name, temp);

  BST_InsertContact(Root, treePtr, Success);

    cout << "Do you wish to add more contacts to this emergency account? (y-yes, n-no)";
    cout << endl;
    cin >> response;
    if (response == 'y')
      LL::LL_Insert(Root);
}



void BST::BST_InsertContact(Node *& Root, Node *& treePtr, bool & Success)
{
  if (Root == NULL)
  {
    Root = new Node;
    Root->LChild = NULL;
    Root->RChild = NULL;
    Root->Next = NULL;

    Root->F_Name = new char[strlen(treePtr->F_Name) + 1];
    strcpy(Root->F_Name, treePtr->F_Name);

    Root->L_Name = new char[strlen(treePtr->L_Name) + 1];
    strcpy(Root->L_Name, treePtr->L_Name);

    Success = bool(Root != NULL);
  }
  else if (Root->L_Name < treePtr->L_Name)
    BST_InsertContact(Root->LChild, treePtr, Success);
  else
    BST_InsertContact(Root->RChild, treePtr, Success);
}


/**********DISPLAY FUNCTIONS***************/

void BST::BST_DisplayInorder()
{
  BST_Inorder(Root);
}

void BST::BST_Inorder(Node * treePtr)
{
  if(treePtr != NULL)
  {
    BST_Inorder(treePtr->LChild);
    BST_Visit(treePtr);
    BST_Inorder(treePtr->RChild);
  }

void BST::BST_Visit(Node * treePtr)
{
    cout << treePtr->F_Name << " | " << treePtr->L_Name << endl;
}
}

void LL::LL_Insert(Node *& treeNode)
{

  char response = 'y';

  while(response == 'y')
  {
  char temp[75];
  Node * CurrPtr;
  CurrPtr = new Node;

  cin.get();
  cout << "Enter contact's first name: " << endl;
  cin.get(temp, 30, '\n');
  CurrPtr->F_Name = new char[strlen(temp) + 1];
  strcpy(CurrPtr->F_Name, temp);

  cin.get();
  cout << "Enter contact's last name: " << endl;
  cin.get(temp, 30, '\n');
  CurrPtr->L_Name = new char[strlen(temp) + 1];
  strcpy(CurrPtr->L_Name, temp);

  if (treeNode->Next == NULL)
  {
    cout << "creating new node...inserting as second node in this list..." << endl;
      treeNode->Next = CurrPtr;
      CurrPtr->Next = NULL;
      CurrPtr->LChild = NULL;
      CurrPtr->RChild = NULL;
  }
  else
  {
    cout << "first node of this list already points to a node...searching to insert..." << endl;
    Node * currentPtr = treeNode;
    Node * prevPtr = NULL;
    while (currentPtr != NULL)
    {
      cout << "made it into the while loop...looping..." << endl;
      prevPtr = currentPtr;
      cout << "just set prevPtr = newPtr..." << endl;
      currentPtr = currentPtr->Next;
      cout << "just set newPtr = newPtr->Next..." << endl;
    }
    cout << "made it out of the while loop..." << endl;

      CurrPtr->LChild = NULL;
      CurrPtr->RChild = NULL;

    if (prevPtr == NULL)
    {
      CurrPtr->Next = currentPtr;
      treeNode->Next = CurrPtr;
    }
    else
    {
      CurrPtr->Next = currentPtr;
      prevPtr->Next = CurrPtr;
    }
  }
  cout << "Do you wish to add more contacts to this emergency account? (y-yes, n-no)";
  cout << endl;
  cin >> response;
  }
}

void BST::BST_Insert()
{
  Node * treePtr;
  treePtr = new Node;
  treePtr->LChild = NULL;
  treePtr->RChild = NULL;
  treePtr->Next = NULL;
  bool Success;

  char temp[75];

  cin.get();
  cout << "Enter contact's first name: " << endl;
  cin.get(temp, 30, '\n');
  treePtr->F_Name = new char[strlen(temp) + 1];
  strcpy(treePtr->F_Name, temp);

  cin.get();
  cout << "Enter contact's last name: " << endl;
  cin.get(temp, 30, '\n');
  treePtr->L_Name = new char[strlen(temp) + 1];
  strcpy(treePtr->L_Name, temp);

  BST_InsertContact(Root, treePtr, Success);

}


void BST::BST_InsertContact(Node *& Root, Node *& treePtr, bool & Success)
{
  char response = 'y';

  if (Root == NULL)
  {
    Root = new Node;
    Root->LChild = NULL;
    Root->RChild = NULL;
    Root->Next = NULL;

    Root->F_Name = new char[strlen(treePtr->F_Name) + 1];
    strcpy(Root->F_Name, treePtr->F_Name);

    Root->L_Name = new char[strlen(treePtr->L_Name) + 1];
    strcpy(Root->L_Name, treePtr->L_Name);

    Success = bool(Root != NULL);

    cout << "Do you wish to add more contacts to this emergency account's list? (y-yes, n-no)";
    cout << endl;
    cin >> response;
    if (response == 'y')
      LL::LL_Insert(Root);

  }
  else if (Root->L_Name < treePtr->L_Name)
    BST_InsertContact(Root->LChild, treePtr, Success);
  else
    BST_InsertContact(Root->RChild, treePtr, Success);
}