$/*$ merge$\_$with$($other$)$

Merge this tree with $`$other$`.$ This is similar to $`$insert$`-$ing all the

values in $`$other$`,$ although there are more efficient ways to go about

doing it$.$

Must run in O$($n$)$ time. $($Note that $`$insert$`-$ing all the values in $`$other$`$

would run in O$($n log n$)$ time, so this requirement rules out that

approach.$)$ n here is the total size of the final tree $($including all the

nodes in this tree, plus all the nodes in the other tree$).$ Must run

in O$($n$)$ space. There are special cases where the runtime can be reduced

to O$($log n$)$ time.

You may need to write some helper functions to aid with this.

$*/$

void merge$\_$with$($const avl$\_$tree& other$)$

$\{$

throw not$\_$implemented$\{\}$;

$\}$

I need help with this function for an AVL tree and how to implement this in my hpp file.