Search engine implementation using link list ,Binary search tree and avl tree i which you did:
A sample file is provided to you ([login to view URL]). In this sample file every pair of lines is a data item. The first of these lines contains an ID and a URL. The second line contains a set of keywords (space separated).
There will be a blank line between pairs of lines. If you see two blank lines in a row that means you have reached the end of the file.
At the start, your program should ask for a filename. Then it will read the database from that file and load it into memory. Your program should ask for a representation to use (List, BST, AVL Tree). This will be used to search later on.
Then, it should present a menu to the user. It should ask for a keyword and then output the list of URLs that match it. At the end it should output the time taken for the search (you can use the code from the first homework for this part).