I don't understand how to start this and am very overwhelmed. But the assignment is attached and is due Sunday night.

 

COP 3502 Computer Science I Spring 2016Assignment 6Due Sunday 10thApril at 11:30 pm.This assignment is worth a maximum of 100 pointsObjectiveBy completing this assignment, students will demonstrate a working knowledge of the followingBinary Search Tree (BST) concepts:1.Code implementation of BST2.Traversing BST3. Algorithm for inserting nodes into a binary search tree4. Deleting nodes from a BST5. Searching for values in BSTProblem: Manipulating Real Estate DatabaseYou are required to create software to manage a real estate database. Because the system must befrequently searched and updated, your team-lead has suggested that you use a BST, ordered onthe listingID, to store all of the property listings.Each property listing is comprised of the following information:Listing ID (an integer)Agent (a string no greater than 12 characters long with no spaces)Price (an integer)Size in square footage (an integer)Number of beds (an integer)Number of baths (a double)Year built (an integer)Address (a string, no longer than 30 characters long)Your code should be able to handle the following database operations:1) Adding a property listing2) Deleting a listed property3) Searching for a listed property by ID4) Searching for properties listed up to a specified price5) Searching for listed properties by Agent6) Listing all of the available propertiesWhen run, your program should read real estate information from an input file calledlistings.txt.It should store this information in a database implemented as a BST, built as each listing is read.Your program should then execute a given set of operations on the created database.

Attachments:

• 1496709735-Assignment 6.pdf