Computer Lab: Binary Tree and Hashing Web search engines are programs that search webpages for specified keywords a relevant webpages the keywords were found. Th main tasks for search engines are matching and ranking. The matching determines which webpages match and the ranking phase determines the relevance of each the matches. Note that search queries can produce of of and a search engine must be capable picking the most relevant results (ranking). The concept of an index is the most fundamental idea behind any search engine. The index for a search engine works the same way as a book's index. The ges the to every single page on and search engines assign builds up an page number book a now the a different web. The engine ndex by making a list of all the words that appear in any page, making a note of the page number in which each word appears, and then sorts that list in alphabetical order. So if a query is made on the word "computer", the search engine can quickly jump to the entry for "computer in the word list and extract the pages for that entry Rather than build an index for webpages, this lab will build an index, or a cross- reference listing, for text-based documents. The lab will display the number of times each word appears in the document, the line numbers in which each word appears and the position of each word in the line. The lab will also allow us to query the document for specific words and will display the number of times the word appears in the document, the line numbers in which the word appears and the position of the word in the line. At the outset we do not know how many different words are in the text, nor do we know in how many different lines a word may appear. Our approach will be to use an object binary search tree whose nodes provide for the following fields: a Word object "two references to the left and right children of the current node Note that while the objectTreeNode class is built to hold a generic object you'll be creating a word class whose objects will be placed in the des of the object binary search tree us on Data Structures Page 453