I need the printPathsBackToRoot method to be modified so that it prints my desired output: I need it to output :

Jacksonville

Miami Jacksonville

Chicago Jacksonville

Omaha Miami Jacksonville

Boston Chicago Jacksonville

NYC Chicago Jacksonville

Orlando Omaha Miami Jacksonville

Atlanta NYC Chicago Jacksonville

Tampa NYC Chicago Jacksonville

The input file to create the tree has the values:Jacksonville Magenta

Miami Yellow L

Chicago DarkGreen R

Omaha Purple LL

Boston Yellow RL

NYC Magenta RR

Orlando Amber LLR

Atlanta Pink RRL

Tampa Magenta RRR

Here is what mine looks like:

public String printPathsBackToTheRoot$()\{$

if $($root $==$ null$)$ return $""$;

StringBuilder result $=$ new StringBuilder$()$;

Queue queue $=$ new LinkedList;

queue.add$($root$)$;

while $(!$queue.isEmpty$())\{$

Node current $=$ queue.poll$()$;

$//$ If the current node is a leaf node, print the path to the root

if $($current$.$left $==$ null && current.right $==$ null$)\{$

List path $=$ new ArrayList;

Node temp $=$ current;

while $($temp $!=$ null$)\{$

path.add$($temp$.$city$)$;

temp $=$ temp.parent;

$\}$

Collections.reverse$($path$)$;

result.append$($String$.$join$("",$ path$)).$append$("$

$")$;

$\}$

$//$ Add left and right children to the queue

if $($current$.$left $!=$ null$)\{$

queue.add$($current$.$left$)$;

$\}$

if $($current$.$right $!=$ null$)\{$

queue.add$($current$.$right$)$;

$\}$

$\}$

return result.toString$().$trim$()$;

$\}$

Can you please make a code file that creates a tree then outputs the values as specified i will give a picture public String printPathsBackToTheRoot$()\{...\}$

This method returns all node$-$to$-$root paths. The nodes should be considered in the

elevator order, as described in Method $1.$ You can simply use a queue like Method

$3$ for this. First, you should enqueue the left child and then the right child. For the

example tree, this method should return the following string. The parent field inside

every node will help you now to easily climb up to the root. Use newline characters

to introduce newlines in the return string.

Jacksonville

Miami Jacksonville

Chicago Jacksonville

Omaha Miami Jacksonville

Boston Chicago Jacksonville

NYC Chicago Jacksonville

Orlando Omaha Miami Jacksonville

Atlanta NYC Chicago Jacksonville

Tampa NYC Chicago Jacksonville public ChromaticTree$($String inputFile$)\{dots\}$

This constructor reads a binary tree encoding from the argument input file inputFile

and builds the unique binary tree. If the tree has $n$ nodes, then the file has $n$ lines,

one line for every node. See the example below, a binary tree and its corresponding

file representation.

The nodes are stored according to their levels in the tree. So$,$ first the root is stored,

then the nodes in the next level, and so on$.$ The nodes in the same level are stored

starting with the leftmost one. We are calling this type of traversal as the elevator

order traversal $($every level is visited one after another akin to an elevator system$).$

Every line contains three elements $-$ the first element is a city name, the second

element is a color, and the third is a string made up of $Ls$ and $Rs$ representing the

path of insertion starting from the root to the node. An $L$ represents $\text{'}$go left' and an

$R$ represents $\text{'}$go right'.

For the root node, we do not store anything for its insertion path. The insertion paths

are unique; two cities won't have the same insertion path. In our implementation,

every node has a parent field that points to its parent.