This is the Java code that needs to be edited. import java.util.*;public class BTNode<T> {private T element;private BTNode<T> left;private BTNode<T> right;/**Constructs a binary tree node that stores the specified element. */public BTNode(T element) {this.element = element;left = right = null;}/** Returns the element stored in this node. */public T getElement() {return element;}/** Sets the element stored in this node.*/public void setElement (T element) {this.element = element;}/** Returns the left subtree of this node.*/public BTNode<T> getLeft() {return left;}/** Sets the left child of this node. */public void setLeft (BTNode<T> left) {this.left = left;}/** Returns the right subtree of this node. */public BTNode<T> getRight() {return right;}/**Sets the right child of this node. */public void setRight (BTNode<T> right) {this.right = right;}//...} // end of class Sample Output of Program:Welcome to Text/Huffman Code ConversionChoose below (Enter Numbers Only)1. Text to Huffman Code2. Huffman Code to Text3. Exit1--Text to Huffman Code--Enter a text: abcHuffman code: 01001100Would you like to convert again? (Y/N)yChoose below (Enter Numbers Only)1. Text to Huffman Code2. Huffman Code to Text3. Exit2--Huffman Code to Text-Enter a Huffman Code: 000100101Text: hedWould you like to convert again? (Y/N)YChoose below (Enter Numbers Only)1. Text to Huffman Code2. Huffman Code to Text3. Exit3Process finished with exit code 0 Java Programming - Tree Data StructuresPlease help me with this!*Console-based programCreate a program that allows the user to this:TO DO:A. Input a text that will be converted to Huffman code.- Output an error message if the text cannot be converted (e.g., using character/s inthe input text that is/are not part of the table Huffman codes).B. Input a Huffman code that will be converted to its equivalent text.- Output an error message if the input cannot be converted.C. Output the Huffman Tree - (BONUS)D. Use the Binary Tree Node Provided below

Answered: Sample Output of Program: Welcome to…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

This is the Java code that needs to be edited.

import java.util.*;
public class BTNode<T> {
private T element;
private BTNode<T> left;
private BTNode<T> right;
/**Constructs a binary tree node that stores the specified element. */
public BTNode(T element) {
this.element = element;
left = right = null;
}
/** Returns the element stored in this node. */
public T getElement() {
return element;
}
/** Sets the element stored in this node.*/
public void setElement (T element) {
this.element = element;
}
/** Returns the left subtree of this node.*/
public BTNode<T> getLeft() {
return left;
}
/** Sets the left child of this node. */
public void setLeft (BTNode<T> left) {
this.left = left;
}
/** Returns the right subtree of this node. */
public BTNode<T> getRight() {
return right;
}
/**Sets the right child of this node. */
public void setRight (BTNode<T> right) {
this.right = right;
}
//...
} // end of class