Read through the My Java code and create an understanding of it$.$

$///$My Code$///$

import java.util.$*$;

public class Huffman $\{$

public static void main$($String$[]$ args$)\{$

String message $=$ "Hello world";

Scanner scanner $=$ new Scanner$($System$.$in$)$;

while $(!$message.equalsIgnoreCase$("$quit$"))\{$

System.out.println$("$Enter a message: $")$;

message $=$ scanner.nextLine$()$;

new Huffman$().$process$($message$)$;

$\}$

System.out.println$("$BYE$!!!")$;

scanner.close$()$;

$\}$

private void process$($String phrase$)\{$

System.out.println$("$Original: $"+$ phrase$)$;

PriorityQueue priorityQueue $=$ new PriorityQueue$($phrase$.$length$())$;

for $($int i $=0$; i $<$ phrase.length$()$; i$++)\{$

char c $=$ phrase.charAt$($i$)$;

priorityQueue.insert$($c$)$;

$\}$

while $($priorityQueue$.$size$()>1)\{$

Node n$1=$ priorityQueue.remove$()$;

Node n$2=$ priorityQueue.remove$()$;

Node p $=$ createParent$($n$1,$ n$2)$;

priorityQueue.insert$($p$)$;

$\}$

Tree huffmanTree $=$ new Tree$()$;

huffmanTree.setRoot$($priorityQueue$.$remove$())$;

String code $=$ huffmanTree.encode$($phrase$)$;

System.out.println$("$Coded: $"+$ code$)$;

String message $=$ huffmanTree.decode$($code$)$;

System.out.println$("$Decoded: $"+$ message$)$;

$\}$

private Node createParent$($Node n$1,$ Node n$2)\{$

Node nn $=$ new Node$(\text{'}\backslash 0\text{'},$ n$1.$frequency $+$ n$2.$frequency$)$;

if $($n$1.$frequency $<$ n$2.$frequency$)\{$

nn$.$leftChild $=$ n$1$;

nn$.$rightChild $=$ n$2$;

$\}$ else $\{$

nn$.$leftChild $=$ n$2$;

nn$.$rightChild $=$ n$1$;

$\}$

return nn;

$\}$

$\}$