Question

Could you guys write an efficient java program to implement BST. Your java program should read words and its corresponding French and store it in a BST. Then read every English word
and print its corresponding French by searching in BST. Assume your java program is in
xxxxx5.java file (5th java project), where xxxxx is the first 5 characters of your last name.
To compile: javac xxxxx5.java
To execute: java xxxxx5 < any data file name
Your main method should be as follow:

public static void main(String args[]) {
xxxxx5 bst = new xxxxx5 (); // xxxxx is the first 5 characters of your last name
try{
Scanner inf = new Scanner (System.in);
// Read input from KB/ File
// read no. of words
n = inf.nextInt();
for (i = 1; i <= n; i++){
// read English word
english = inf.next();
// read corresponding word
french = inf.next();
bst.insert(english, french);
}
while(inf.hasNext()){
// read next English word
english = inf.next();
search in BST and print its corresponding French if exist.
}// end while
inf.close();// close input file
}catch (Exception e) {prt("\nException " + e + "\n");}
}// end main method

Sample data file can be as follow:
5 student etudiant book livre this cette is est a une this is a book

Answer 1

Hi,

Please find below code for your reference. Also I have attached Program and Output screenshots.

Code:-

import java.util.Scanner;

public class TreeNode {
  
   private TreeNode right;
   private TreeNode left;
   private String english;
   private String french;
  
   public TreeNode(String s, String d) {
       english = s;
       french = d;
   }
   public String find (String s) {
       if (s.equals(english)) {
           return french;
       }
       if (s.compareTo(english) < 0) {
           if (right != null)
               return right.find(s);
           return "";
       }
       else {
       if (left != null)
           return left.find(s);
           return "";
       }
   }
   public void insert (String s, String d) {
  
       if (s.equals(english)) {
           french = d;
           return;
       }
       if (s.compareTo(english) < 0) {
      
           if (right != null)
               right.insert(s,d);
           else
               right = new TreeNode(s,d);
           return;
       }
       if (left != null)
           left.insert(s,d);
       else
           left = new TreeNode(s,d);
   }
  
   public static void main(String args[])
   {
   TreeNode tn = new TreeNode("English","French");
   Scanner inf = new Scanner (System.in);
   int n = inf.nextInt();
   for(int i=1;i<=n;i++)
   {
   String english = inf.next();
   String french = inf.next();
   tn.insert(english,french);
   }
   while (inf.hasNext())
   {
   String english = inf.next();
   System.out.println("English->"+english);
   String french = tn.find(english);
   System.out.println("French->"+french);
   }
   inf.close();
  
   }
}