Complete the code for all the tree traversal functions. Run the program, your code should display the following output.

#### INORDER TRAVERSAL #####

$427581369$

#### PREORDER TRAVERSAL #####

$124578369$

#### POSTORDER TRAVERSAL #####

$478529631$

#include

using namespace std;

struct node$\{$

int element;

node $*$left;

node $*$right;

node$($int element$)\{$

this$->$element $=$ element;

left$=$ right$=$nullptr;

$\}$

$\}$;

void process$($int element$)\{$

cout $<<$ element $<<""$;

$\}$

void inorderTraversal$($node $*$ n$)\{$

$//$insert code here for inorderTraversal

$\}$

void preorderTraversal$($node $*$ n$)\{$

$//$insert code here for preorderTraversal

$\}$

void postorderTraversal$($node $*$ n$)\{$

$//$insert code here for postorderTraversal

$\}$

int main$($int argc, const char $*$ argv$[])\{$

node $*$root $=$ new node$(1)$;

node $*$node$2=$ new node$(2)$;

node $*$node$3=$ new node$(3)$;

node $*$node$4=$ new node$(4)$;

node $*$node$5=$ new node$(5)$;

node $*$node$6=$ new node$(6)$;

node $*$node$7=$ new node$(7)$;

node $*$node$8=$ new node$(8)$;

node $*$node$9=$ new node$(9)$;

root$->$left $=$ node$2$;

root$->$right $=$ node$3$;

node$2->$left $=$ node$4$;

node$2->$right $=$ node$5$;

node$5->$left $=$ node$7$;

node$5->$right $=$ node$8$;

node$3->$right $=$ node$6$;

node$6->$right $=$ node$9$;

cout $<<"$#### INORDER TRAVERSAL #####$"<<$ endl;

inorderTraversal$($root$)$;

cout $<<$ endl $<<"$#### PREORDER TRAVERSAL #####$"<<$ endl;

preorderTraversal$($root$)$;

cout $<<$ endl$<<"$#### POSTORDER TRAVERSAL #####$"<<$ endl;

postorderTraversal$($root$)$;

return $0$;

$\}$