Question

Please create a class in Java that completes the following conditions

Using your Morse code tree from last assignment, complete the following additional tasks: Write a program that will repeatedly ask the user for one of five options: o Enter "pre" to produce the preorder of your Morse code tree o Enter "post" to produce the postorder of your Morse code tree • Enter "t" to translate an English string into its Morse code equivalent (ignoring case) • Enter "r" to translate a Morse code string into its English equivalent O Enter "q" to quit For pre/post orders, it is sufficient to call the respective methods at the root. Format the output as shown on the following page For "t", you must then ask for a string, and then use your tree to translate each character to Morse Code, one at a time. Use string building here (start with an empty string, and add on each translation over time). Also, note that this will require using a Tree searching scheme. You need to implement this recursively, but must determine the strategy yourself. Consider what you are returning from your search, and what you are passing into it (best hint I can give). For "r", you must then ask for a string of Morse code symbols, and then use your tree to translate each symbol cluster, one at a time. Use string building here too, and look at how you did the tree insertions for hints on how to do this one. For "q", just end the program gracefully. Finally, a good way to test "r" and "t" is to use the output of one on the other, and see if you get the string you began with (this is how it will be graded!)

MorseTree.java

/* This program will read in letters followed by their morse code
* and insert them properly in a tree based on the amount of symbols
* it has and whether they are left or right descendent. Finally
* it prints a few certain nodes.
*/
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class MorseTree {

   public static void main(String[] args) throws FileNotFoundException {

       // Scanner object for text file
       Scanner file = new Scanner(new File("morsecode.txt"));

       // Creates root node for tree
       TreeNode<String> root = new TreeNode<String>();

       while (file.hasNext()) {
           // Stores next line of file as a string
           String line = file.nextLine();

           // scans the line for the element and its insertion path
           Scanner code = new Scanner(line);

           // temp and current nodes used for insertion to tree
           TreeNode<String> temp = new TreeNode<String>(code.next());
           TreeNode<String> current = root;

           while (code.hasNext()) { // PRE: String is passed in
               if (code.next().equals("o")) {
                   if (current.getLeft() == null)
                       current.setLeft(temp);
                   else
                       current = current.getLeft();
               } else {
                   if (current.getRight() == null)
                       current.setRight(temp);
                   else
                       current = current.getRight();
                   // POST: symbol is inserted to tree based on if its left or right descendent
               }
           }
           code.close();
       }
       file.close();

       // prints z ( - - o o)
       System.out.println(root.getRight().getRight().getLeft().getLeft().getElement());

       // prints q (- - o -)
       System.out.println(root.getRight().getRight().getLeft().getRight().getElement());

       // prints r (o - o)
       System.out.println(root.getLeft().getRight().getLeft().getElement());
   }
}

TreeNode.java

public class TreeNode<T> {
   private T element;
   private TreeNode<T> left;
   private TreeNode<T> right;

   public TreeNode(T element) {
       this.element = element;
   }

   public TreeNode() {
       this.element = null;
   }

   public T getElement() {
       return element;
   }

   public TreeNode<T> getLeft() {
       return left;
   }

   public TreeNode<T> getRight() {
       return right;
   }

   public boolean isLeaf() {
       return this.getLeft() == null && this.getRight() == null;
   }

   public void setLeft(TreeNode<T> t) {
       left = t;
   }

   public void setRight(TreeNode<T> t) {
       right = t;
   }

   public void preorder(TreeNode<T> node) {
       if (node == null) {
           return;
       }
       System.out.println(node.getElement());
       preorder(node.getLeft());
       preorder(node.getRight());
   }

   public void postorder(TreeNode<T> node) {
       if (node == null) {
           return;
       }
       postorder(node.getLeft());
       postorder(node.getRight());
       System.out.println(node.getElement());
   }

   public int height() {
       if (this.isLeaf()) {
           return 0;
       } else if (this.getLeft() != null && this.getRight() == null) {
           return this.getLeft().height() + 1;
       } else if (this.getLeft() == null && this.getRight() != null) {
           return this.getRight().height() + 1;
       } else {
           return Math.max(this.getLeft().height(), this.getRight().height()) + 1;
       }
   }

   public void insert(T element) {
       TreeNode<T> insertTarget = new TreeNode<T>(element);
//       while(!temp.isLeaf()) {
//           temp = temp.getLeft();
//       }
//       temp.setLeft(insertTarget);

//       if (this.isLeaf()) {
//           this.setLeft(insertTarget);
//       }
//       else if (this.getLeft() == null) {
//           this.setLeft(insertTarget);
//       }
//       else if (this.getRight() == null){
//           this.setRight(insertTarget);
//       }
//       else {
//           this.getLeft().insert(element);
//       }

//       if (height() == 0) {
//           return;
//       }
       if (height() == 0) {
           this.setLeft(insertTarget);
       } else {
           if (this.getLeft() == null) {
               this.setLeft(insertTarget);
           } else if (this.getRight() == null) {
               this.setRight(insertTarget);
           } else {
               if (this.getLeft().height() <= this.getRight().height()) {
                   this.getLeft().insert(element);
               } else if (this.getLeft().height() > this.getRight().height()) {
                   this.getRight().insert(element);
               }
           }
       }
   }

   public void insertLeft(T element) {
       if (this.getLeft() == null) {
           this.setLeft(new TreeNode<T>(element));
       } else {
           System.out.println("Tried to insert a node overwriting an existing node on the left!");
       }
   }

   public void insertRight(T element) {
       if (this.getRight() == null) {
           this.setRight(new TreeNode<T>(element));
       } else {
           System.out.println("Tried to insert a node overwriting an existing node on the right!");
       }}}

morsecode.txt

e o
t -
i o o
a o -
n - o
m - -
s o o o
u o o -
r o - o
w o - -
d - o o
k - o -
g - - o
o - - -
h o o o o
v o o o -
f o o - o
l o - o o
p o - - o
j o - - -
b - o o o
x - o o -
c - o - o
y - o - -
z - - o o
q - - o -

Please create the test class the completes the bulleted requests in the beginning.

Answer 1

import java.io.File;

import java.io.FileNotFoundException;

import java.util.*;

public class MorseTree {

private TreeNode root;

//Constructor for the morseTree, Opens file and reads the morse translation

public MorseTree() {

//first, open data.txt, add each line to the tree

Scanner fin;

try {

File file = new File("data.txt");

fin = new Scanner(file);

while(fin.hasNextLine()){

String temp = fin.nextLine();

add(temp.substring(2), temp.charAt(0));

}

} catch (FileNotFoundException e) {

System.out.println("File not found!");

e.printStackTrace();

}

}

// add sends to insertInSubtree

public void add(String morseStr, char letter) {

root = insertInSubtree(morseStr, letter, root);

}

// Inserts the character to the appropriate location within the tree

private TreeNode insertInSubtree(String morseStr, char letter, TreeNode subtree) {

if(subtree == null)

return insertInSubtree(morseStr, letter, new TreeNode());

if(morseStr.length() == 1){

subtree.data = letter;

return subtree;

}

else if(morseStr.charAt(0)=='.')

subtree.setRight(insertInSubtree(morseStr.substring(1), letter, subtree.right));

else if(morseStr.charAt(0)=='-')

subtree.setLeft(insertInSubtree(morseStr.substring(1), letter, subtree.left));

return subtree;

}

public Character translate(String morseStr) {

return findInSubtree(morseStr, root);

}

private Character findInSubtree(String morseStr, TreeNode subtree) {

if(subtree == null)

return null;

if(morseStr.length() == 0)

return (Character) subtree.data;

else if(morseStr.charAt(0)=='.')

return findInSubtree(morseStr.substring(1), subtree.right);

else if(morseStr.charAt(0)=='-')

return findInSubtree(morseStr.substring(1), subtree.left);

return null;

}

// translates a string by concantenating a string of morseStrings

public String translateString(String tokens) {

String retVal = "";

Scanner input = new Scanner(tokens);

while(input.hasNext())

retVal += findInSubtree(input.next(), this.root)+ " ";

input.close();

return retVal;

}

/*

public String toMorseCode(Character c) {

.

//walk the tree looking for the TreeNode with the char c in it

//preorder walk?

//inorder walk?

//postorder walk?

return new String("You wish.");

}

public String toString() {

return inorderWalk();

}

private String inorderWalk() {

return new String("Another wish.");

}

*/

public static void main(String[] args) {

MorseTree mt = new MorseTree(); //builds our tree using data from a file

System.out.println();

System.out.println(mt.translateString(".- -... -.-. -.. .")); //prints out A B C D E

System.out.println(mt.translateString("..-. --. .... .. .---")); //prints out F G H I J

System.out.println(mt.translateString("-.- .-.. -- -. ---")); //prints out K L M N O

System.out.println(mt.translateString(".--. --.- .-. ... -")); //prints out P Q R S T

System.out.println(mt.translateString("..- ...- .-- -..- -.--")); //prints out U V W X Y

System.out.println(mt.translateString("--.. ----- .---- ..--- ...--")); //prints out Z 0 1 2 3

System.out.println(mt.translateString("....- ..... -.... --... ---..")); //prints out 4 5 6 7 8

System.out.println(mt.translate("----.")); //prints out 9

System.out.println(mt.translate(".......-")); //prints out null

System.out.println(mt.translateString("... --- ...")); //SOS

//System.out.println(mt.toMorseCode('S')); //find where we are in the tree, remember path to root

}

private class TreeNode {

Object data;

TreeNode right;

TreeNode left;

public TreeNode() {

this.data = null;

this.right = null;

this.left = null;

}

public TreeNode(Object data, TreeNode leftNode, TreeNode rightNode){

this.data = data;

this.left = leftNode;

this.right = rightNode;

}

public void setRight(TreeNode rightNode) {

this.right = rightNode;

}

public void setLeft(TreeNode leftNode) {

this.left = leftNode;

}

}

}

-----------------------------------------------------------------------------------------------------

import java.io.*;

import java.util.*;

public class CharTree {

private static class TreeNode {

private char data;

private TreeNode leftLink;

private TreeNode rightLink;

public TreeNode(char newData, TreeNode newLeftLink, TreeNode newRightLink) {

this.data = newData;

this.leftLink = newLeftLink;

this.rightLink = newRightLink;

}

}

// The first node of the tree, called root

private TreeNode root;

// Default constructor to build the CharTree

public CharTree( ) {

root = null;

}

// Utility methods for CharTree:

public void add(char item) {

root = insertInSubtree(item, root);

}

public boolean contains(char item) {

return isInSubtree(item, root);

}

public void showElements( ) {

showElementsInSubtree(root);

}

private static TreeNode insertInSubtree(char item, TreeNode subTreeRoot) {

if (subTreeRoot == null)

return new TreeNode(item, null, null);

else if (item < subTreeRoot.data) {

subTreeRoot.leftLink = insertInSubtree(item, subTreeRoot.leftLink);

return subTreeRoot;

}

else { //item >= subTreeRoot.data

subTreeRoot.rightLink = insertInSubtree(item, subTreeRoot.rightLink);

return subTreeRoot;

}

}

private static boolean isInSubtree(char item, TreeNode subTreeRoot) {

// base case: is subTreeRoot null? then return false

if(subTreeRoot == null)

return false;

else if(subTreeRoot.data == item)

return true;

else if(item < subTreeRoot.data)

return isInSubtree(item, subTreeRoot.leftLink);

else if(item >= subTreeRoot.data)

return isInSubtree(item, subTreeRoot.rightLink);

return false; // Failsafe

}

private static void showElementsInSubtree(TreeNode subTreeRoot) { //Uses inorder traversal.

if (subTreeRoot != null) {

showElementsInSubtree(subTreeRoot.leftLink);

System.out.print(subTreeRoot.data + " ");

showElementsInSubtree(subTreeRoot.rightLink);

} //else do nothing. Empty tree has nothing to display.

}

public static void main(String[] args) {

CharTree tree = new CharTree();

tree.add('c');

tree.add('a');

tree.add('t');

tree.add('s');

showElementsInSubtree(tree.root);

System.out.println();

System.out.println("Is 'a' in the subtree? "+isInSubtree('a', tree.root));

System.out.println("Is 't' in the subtree? "+isInSubtree('t', tree.root));

System.out.println("Is 'b' in the subtree? "+isInSubtree('b', tree.root));

}

}

MorseTree [-/ldeaProjects/MorseTree] - ../sro/MorseTree.java [MorseTree] G MorseTree MorseTree src Main O Project- V MorseTree -/ldeaProjects/MorseTree idea O +|0- - G MorneTree java G CharTree java a data.txt import java. io. File; import java.io. FileNotFoundExcept ion; eimport java.util.; out public class MorseTree { private TreeNode root; //Constructor for the morseTree, Opens file and reads the morse translation src GCharTree a data.txt G MorseTree public MorseTree() { MorseTree.iml 10 22 Itirst, open data. txt, add each Line to the tree Scanner fin; try { File file = neu Filel pathname "data.txt"); fin = new Scanner(file); white(fin.hasNextLine()){ String temp = fin.nextLine (); lih External Libraries 12 O Scratches and Consoles 13 14 15 26 17 18 add (temo. substring(2). temp.charAt (0)): 20 20 } catch (FileNotFoundException e) { System. out.print In("File not found!"); e.printStackTrace(); 21 22 23 24 25 26 MorseTree0 MorseTree Run: Main /Library/Java/Javavirtua Machines/jdk-9.0.4.jdk/Contents/Home/bin/java "-javaagent:/Applications/Intelli IDEA. app/Contents/lib/idea_rt.jar=49332:/Applications/Intelli IDEA. app/Contents/bin" -Df I N6 nullXI null 2 5 U1 E Y nullOK null 11 null null LVN F3P null null 7 null null nult null null null null null null null null V null V Process finished with exit code 0 I Compilation completed successtully in 4o 93ms (2 minutes ago) 14:35 LF: UTF-8: a 9 O

Note:---If you have any doubts then commebt below