c$++,$ please solve the to do sections in the BSTMap.

#ifndef $\_\_$BSTMAP$\_$H$\_\_$

#define $\_\_$BSTMAP$\_$H$\_\_$

#include

#include

#include

#include

#include

#include

#include

using namespace std;

class BSTMapNode $\{$

public:

string key;

int value;

BSTMapNode $*$left;

BSTMapNode $*$right;

BSTMapNode$($const string &k$,$ const int &v$,$

BSTMapNode $*$l $=$ nullptr,

BSTMapNode $*$r $=$ nullptr$)\{$

key $=$ k;

value $=$ v;

left $=$ l;

right $=$ r;

$\}$

$\}$;

class BSTMap $\{$

$//$friend class BSTPrinter;

private:

BSTMapNode $*$root; $//$ Root of the BST

public:

BSTMap$()\{$ root $=$ nullptr; $\}$

~BSTMap$()\{$ clear$($root$)$; $\}$

$/**$ Delete all nodes. $*/$

void clear$($BSTMapNode $*$root$)\{$

if $($root $==$ nullptr$)$

return;

clear$($root$->$left$)$;

clear$($root$->$right$)$;

delete root;

$\}$

$/**$

$*$ Print the BST level by level, from top to bottom and left to right.

$*/$

void print$($ostream &os$)\{$

vector$>$ lines;

vector level;

vector next;

level.push$\_$back$($root$)$;

int nn $=1$;

size$\_$t widest $=0$;

while $($nn $!=0)\{$

vector line;

nn $=0$;

for $($BSTMapNode $*$n : level$)\{$

if $($n $==$ nullptr$)\{$

line.push$\_$back$("")$;

next.push$\_$back$($nullptr$)$;

next.push$\_$back$($nullptr$)$;

$\}$ else $\{$

std::stringstream ss;

ss $<<$ n$->$key $<<"$:$"<<$ n$->$value;

string aa $=$ ss$.$str$()$;

line.push$\_$back$($aa$)$;

if $($aa$.$length$()>$ widest$)$

widest $=$ aa$.$length$()$;

next.push$\_$back$($n$->$left$)$;

next.push$\_$back$($n$->$right$)$;

if $($n$->$left $!=$ nullptr$)$

nn$++$;

if $($n$->$right $!=$ nullptr$)$

nn$++$;

$\}$

$\}$

if $($widest $\%2==1)$

widest$++$;

lines.push$\_$back$($line$)$;

vector tmp $=$ level;

level $=$ next;

next $=$ tmp;

next.clear$()$;

$\}$

int perpiece $=$ lines.at$($lines$.$size$()-1).$size$()*($widest $+4)$;

for $($size$\_$t i $=0$; i $<$ lines.size$()$; i$++)\{$

vector line $=$ lines.at$($i$)$;

int hpw $=($int$)$floor$($perpiece $/2.$f$)-1$;

if $($i $>0)\{$

for $($size$\_$t j $=0$; j $<$ line.size$()$; j$++)\{$

$//$ split node

char c $=\text{'}\text{'}$;

if $($j $\%2==1)\{$

if $($line$.$at$($j $-1)!="")\{$

c $=\text{'}+\text{'}$;

$\}$ else if $($j $<$ line.size$()$ && line.at$($j$)!="")\{$

c $=\text{'}+\text{'}$;

$\}$

$\}$

os $<<$ c;

$//$ lines and spaces

if $($line$.$at$($j$)=="")\{$

for $($int k $=0$; k $<$ perpiece $-1$; k$++)\{$

os $<<""$;

$\}$

$\}$ else $\{$

for $($int k $=0$; k $<$ hpw; k$++)\{$

os $<<($j $\%2==0?""$ : $"")$;

$\}$

os $<<($j $\%2==0?""$ : $"")$;

for $($int k $=0$; k $<$ hpw; k$++)\{$

os $<<($j $\%2==0?""$ : $"")$;

$\}$

$\}$

$\}$

$//$ os $<<"\backslash$

$\backslash "$

$"$;

os $<<"$

$"$;

$\}$

for $($size$\_$t j $=0$; j $<$ line.size$()$; j$++)\{$

string f $=$ line.at$($j$)$;

int gap$1=($int$)$ceil$($perpiece $/2.$f $-$ f$.$length$()/2.$f$)$;

int gap$2=($int$)$floor$($perpiece $/2.$f $-$ f$.$length$()/2.$f$)$;

for $($int k $=0$; k $<$ gap$1$; k$++)\{$

os $<<""$;

$\}$

os $<<$ f;

for $($int k $=0$; k $<$ gap$2$; k$++)\{$

os $<<""$;

$\}$

$\}$

$//$ os $<<"\backslash$

$\backslash "$

$"$;

os $<<"$

$"$;

perpiece $/=2$;

$\}$

$\}$

void put$($const string &ik$,$ const int &val$)$;

bool find$($const string &sk$)$ const;

int get$($const string &sk$)$ const;

void remove$($const string &rk$)$;

$\}$;

$/**$

$*$ Insert the key$-$value pair $`$ik$`$ and $`$val$`$ to the BSTMap.

$*$

$*$ @param ik The key to insert

$*$ @param val The value corresponding to the key

$*/$

void BSTMap::put$($const string &ik$,$ const int &val$)\{$

$//$ TODO

$\}$

$/**$

$*$ Search for given key in the BSTMap.

$*$

$*$ @param sk The search key

$*$ @return true if $`$sk$`$ is in the BSTMap

$*/$

bool BSTMap::find$($const string &sk$)$ const $\{$

$//$ TODO:

bool v $=$ false; $//$ placeholder to make sure the code can compile

return v;

$\}$

$/**$

$*$ Return the value of the given search key $`$sk$`$ in the BSTMap.

$*/$

int BSTMap::get$($const string &sk$)$ const $\{$

$//$ TODO: You may assume that $`$sk$`$ is in the BSTMap.

int v; $//$ placeholder to make sure the code can compile

return v;

$\}$

$/**$

$*$ Remove $`$rk$`$ and its corresponding value from the BST$.$

$*/$

void BSTMap::remove$($const string &rk$)\{$

$//$ TODO: You may assume that $`$rk$`$ is in the BSTMap.

$\}$

#endif $//\_\_$BSTMAP$\_$H$\_\_$