mplement the Tree$234$Iterator to satisfy the complexity requirements mentioned above. Code in LabProgram.java adds random keys to a Tree$234$ object, then tests that the iterator properly iterates through all keys in ascending order. But time and space complexity aren't tested by LabProgram. LabProgram only ensures that the iterator properly iterates through all keys.

Most unit tests will fail if the iterator does not properly iterate through all the tree's keys in the correct order. So run code in develop mode and ensure that the test passes before submitting code.

The iterator never changes the tree in any way

Iteration starts at the tree's minimum key and ends at the maximum

Construction occurs in worst$-$case O$($log N$)$ time

hasNext$()$ executes in worst$-$case O$(1)$ time

next$()$ executes in worst$-$case O$($log N$)$ time

The iterator's space complexity is worst$-$case O$($log N$)$import java.util.$*$;

public class Tree$234$Iterator implements Iterator $\{$

$//$ Your code here

public Tree$234$Iterator$($Node$234$ treeRootNode$)\{$

$//$ Your code here

$\}$

public boolean hasNext$()\{$

$//$ Your code here $($remove placeholder line below$)$

return false;

$\}$

public Integer next$()\{$

$//$ Your code here $($remove placeholder line below$)$

return $0$;

$\}$

$\}$