Help in Java:
HELP IN JAVA Write a program that maintains the names, birth dates, phone numbers of your friends and relatives Create an input file with the information of one person per line and in the order listed above. Names will be first name, last name (separated by a space). Birth dates will be in the form 04/01/2017. Phone numbers will be of the form 312-255-2000 Create a class called Person . An object of this class will contain the info for one person. To compare two Person objects, compare their last names. Assume they are equal if their last names are the same. (yes, this isn't reasonable but I didn't feel like asking you to have a unique identifier. So for this assignment everyone has a different last name) You are to create a binary search tree of person objects Once the tree is created, the user should be able to input from the keyboard in order to: 1. enter another person 2. modify the info for a persorn 3. search this tree for all the data for a person . This means you print out all the data for the person 4. The user should also be able to list everyone in the tree (and their info) 5. search for (and list) all the people who were born in a certain month 6. quit Your input is in a file. IT IS INCORRECT to input it into an array and then create a tree from the array. Some of you have done this in the labs, but although you get the right answer it is still BAD PRACTICE. Imagine you have 1 million records, putting them into an array and also a tree occupies twice as much space as you need, and you will quickly run out of space You have to think about how efficient your programs are - not just whether you get the correct output Input File: Bilal Alharsha 04/01/1993 312-255-2000 Ahmad Alshair 05/02/1992 345-233-4893 Ahmad Alzubi 06/03/1995 232-254-2230 HELP IN JAVA Write a program that maintains the names, birth dates, phone numbers of your friends and relatives Create an input file with the information of one person per line and in the order listed above. Names will be first name, last name (separated by a space). Birth dates will be in the form 04/01/2017. Phone numbers will be of the form 312-255-2000 Create a class called Person . An object of this class will contain the info for one person. To compare two Person objects, compare their last names. Assume they are equal if their last names are the same. (yes, this isn't reasonable but I didn't feel like asking you to have a unique identifier. So for this assignment everyone has a different last name) You are to create a binary search tree of person objects Once the tree is created, the user should be able to input from the keyboard in order to: 1. enter another person 2. modify the info for a persorn 3. search this tree for all the data for a person . This means you print out all the data for the person 4. The user should also be able to list everyone in the tree (and their info) 5. search for (and list) all the people who were born in a certain month 6. quit Your input is in a file. IT IS INCORRECT to input it into an array and then create a tree from the array. Some of you have done this in the labs, but although you get the right answer it is still BAD PRACTICE. Imagine you have 1 million records, putting them into an array and also a tree occupies twice as much space as you need, and you will quickly run out of space You have to think about how efficient your programs are - not just whether you get the correct output Input File: Bilal Alharsha 04/01/1993 312-255-2000 Ahmad Alshair 05/02/1992 345-233-4893 Ahmad Alzubi 06/03/1995 232-254-2230
