Question

Indexing With Trees Andrew Rosen Abstract a this lab you ate an ind r the wkd W Sa e (gt00.tat) althogh yos c tr w t yor ablity to pet together hiple deta trate and ots Cle ah fe to se what you t glete Your Assignment We will reate an Indertree, aspecial type of Binary Sdh Tr The IndeTree dos a bit moee than your staadand tree, as w wll to bald teatlook wee eah topic is lided in abllatical nr wih re fond on Sisce Sles don't bwe traditiol pags to work ofd ew e lite abers Farthermoe, rather than beilding an ind of ly a Se select topies, we will bild an indes oer all the woeds in the Se To do this, we ue a special type d node The ndesTree in madep of sial Indesodes. Rather th ing grerics e sdesode a wel the cout of occumecs of that woed, ad a lt of all l that wd apped on (this a that each Indexode will bld their os list), Nodes in the t will be sorted by the Strise Use an Isdextree object to store sn inde of all the woeds tht e in the peided test Ele, then disply the ind y prforming ineder tr o the tree, 2 How to Read a File Good es, everyoe You alrdy kw how to do most da Te a file showing how to we Scanner to ad eery e of tet f the Sp that le isto dividaal words, dl priat out ech wed. Te se to s wed of tlae pky pactuations, se co 3 Advice Get the Sle reading wrking Srst, the work on the IsdeaTree Do o tempt to work on the tree without figuring out how to gt the i reading working How to do it depeads our your IDE d your tp R warors and tuteris are availal onlmr, Gmaly to be tod the ia an IDE you aed to pat it in the top t vel of your pjt S My otr advice is start early. Dashboard Calendar Notifications Inbox To Do

Answer 1

// IndexNode.java
import java.util.ArrayList;
import java.util.List;
public class IndexNode {

   // The word for this entry
   String word;
   // The number of occurrences for this word
   int occurrences;
   // A list of line numbers for this word
   List<Integer> list;
  
   IndexNode left;
   IndexNode right;
  
   // Constructors
   // Constructor should take in a word and a line number
   // it should initialize the list and set occurrences to 1
   public IndexNode(String word, int line_number)
   {
       this.word = word;
       this.occurrences = 1;
       list = new ArrayList<Integer>();
       list.add(line_number);
       left = null;
       right = null;
   }
  
   // return the word, the number of occurrences and the lines it appears on
   public String toString()
   {
       return("Word : "+word+" Occurrences : "+occurrences+" Line numbers : "+list.toString());
   }
}
//end of IndexNode.java

//IndexTree.java

public class IndexTree {

      

       private IndexNode root;

      

       public IndexTree()

       {

             root = null;

       }

      

       // method to add a word in the tree

       public void add(String word, int lineNumber)

       {

             root = add(root,word,lineNumber);

       }

      

       private IndexNode add(IndexNode root, String word, int lineNumber)

       {

             if(root == null)

             {

                    root = new IndexNode(word,lineNumber);

             }else

             {

                    if(word.toLowerCase().compareTo(root.word.toLowerCase()) < 0)

                    {

                           root.left = add(root.left,word,lineNumber);

                    }else if(word.toLowerCase().compareTo(root.word.toLowerCase()) > 0)

                    {

                           root.right = add(root.right,word,lineNumber);

                    }else

                    {

                           if(!root.list.contains(lineNumber))

                           {

                                 root.occurrences++;

                                 root.list.add(lineNumber);

                           }

                    }

             }

            

             return root;

       }

      

       //returns true if the word is in the index

       public boolean contains(String word)

       {

             if(root == null)

                    return false;

             IndexNode node = root;

             while(node != null)

             {

                    if(node.word.equalsIgnoreCase(word))

                           return true;

                    else if(word.toLowerCase().compareTo(node.word.toLowerCase()) < 0)

                           node = node.left;

                    else

                           node = node.right;

             }

            

             return false;

       }

      

       // method to delete a word

       public void delete(String word)

       {

             if(root == null)

             {

                    System.out.println(" Tree Empty");

             }else if(!contains(word))

                    System.out.println(word+" not found in tree");

             else {

                    root = delete(root,word);

                    System.out.println(word+" deleted from tree");

             }

       }

      

       //remove the word and all entries for the word

       private IndexNode delete(IndexNode root,String word)

       {

             IndexNode p,n;

            

             if(word.equalsIgnoreCase(root.word))

             {

                    IndexNode lt,rt;

                    lt = root.left;

                    rt = root.right;

                   

                    if(lt == null && rt == null)

                           return null;

                    else if(lt == null)

                           return rt;

                    else if(rt == null)

                           return lt;

                    else {

                           p = rt;

                           while(p.left != null)

                                 p = p.left;

                           p.left = lt;

                           return rt;

                    }

             }

             else if(word.toLowerCase().compareTo(root.word.toLowerCase()) < 0)

             {

                    n = delete(root.left,word);

                    root.left = n;

             }

             else

             {

                    n = delete(root.right,word);

                    root.right = n;

             }

            

             return root;

       }

      

       // prints all the words in the index in inorder order

       public void printIndex()

       {

             printIndex(root);

       }

      

       private void printIndex(IndexNode root)

       {

             if(root == null)

             {

                    return;

             }

             printIndex(root.left);

             System.out.println(root);

             printIndex(root.right);

       }

}

//end of IndexTree.java