In c$++,$ help me fix this codes output as its very strange and a delete function$($prompt:Delete length characters from the Rope starting from start. You can do this by spliting the rope into three, divided by start and start$+$length characters and deleting everything in the middle.$)$ and a substring function $($prompt: Return the substring that starts at character position i and goes to character position j

$.$ Do this by finding the node u that contains the i$-$th character where weight$($u$)$ is greater than or equal to j Then do an in$-$order traversal of tree starting at u$.$

code:

#include

using namespace std;

const int LEAF$\_$LEN $=2$;

class Rope

$\{$

public:

Rope$*$ left, $*$ right, $*$ parent;

char$*$ str;

int lCount;

$\}$;

void createRopeStructure$($Rope$*$& node, Rope$*$ par,

char a$[],$ int l$,$ int r$)$

$\{$

Rope$*$ tmp $=$ new Rope$()$;

tmp$->$left $=$ tmp$->$right $=$ NULL;

tmp$->$parent $=$ par;

if $(($r $-$ l$)>$ LEAF$\_$LEN$)$

$\{$

tmp$->$str $=$ NULL;

tmp$->$lCount $=($r $-$ l$)/2$;

node $=$ tmp;

int m $=($l $+$ r$)/2$;

createRopeStructure$($node$->$left, node, a$,$ l$,$ m$)$;

createRopeStructure$($node$->$right, node, a$,$ m $+1,$ r$)$;

$\}$

else

$\{$

node $=$ tmp;

tmp$->$lCount $=($r $-$ l$)$;

int j $=0$;

tmp$->$str $=$ new char$[$LEAF$\_$LEN$]$;

for $($int i $=$ l; i $<=$ r; i$++)$

tmp$->$str$[$j$++]=$ a$[$i$]$;

$\}$

$\}$

void printstring$($Rope$*$ r$)$

$\{$

if $($r $==$ NULL$)$

return;

if $($r$->$left $==$ NULL && r$->$right $==$ NULL$)$

cout $<<$ r$->$str;

printstring$($r$->$left$)$;

printstring$($r$->$right$)$;

$\}$

void concatenate$($Rope$*$& root$3,$ Rope$*$ root$1,$ Rope$*$ root$2,$ int n$1)$

$\{$

Rope$*$ tmp $=$ new Rope$()$;

tmp$->$parent $=$ NULL;

tmp$->$left $=$ root$1$;

tmp$->$right $=$ root$2$;

root$1->$parent $=$ root$2->$parent $=$ tmp;

tmp$->$lCount $=$ n$1$;

tmp$->$str $=$ NULL;

root$3=$ tmp;

$\}$

void deleted$($int i$,$ int j$,$ Rope$*$& root$2)\{$

for $($; i $<=$ j; i$++)$

$\{$

$//$root$2[$i$]=\text{'}\text{'}$;

$\}$

$\}$

int main$()$

$\{$

Rope$*$ root$1=$ NULL;

char a$[]="$Hi $"$;

int n$1=$ sizeof$($a$)/$ sizeof$($a$[0])$;

createRopeStructure$($root$1,$ NULL, a$,0,$ n$1-1)$;

Rope$*$ root$2=$ NULL;

char b$[]=$ "How are you";

int n$2=$ sizeof$($b$)/$ sizeof$($b$[0])$;

createRopeStructure$($root$2,$ NULL, b$,0,$ n$2-1)$;

Rope$*$ root$3=$ NULL;

concatenate$($root$3,$ root$1,$ root$2,$ n$1)$;

printstring$($root$3)$;

cout $<<$ endl;

return $0$;

deleted$($n$1-1,$ n$2-1,$ root$3)$;

$\}$