NB: Use C$++$ coding

$($d$)$ Declare the structure for the binary search tree, defined as

Implement the insert algorithm to insert the key based on BST properties. The function

declaration is given as

void insertBSTNode$($BSTNode$*$ tree, int key$)$

$($e$)$ If the structure of the binary search tree is defined as

What will be the search algorithm for searching an item, key and returning the node which

contains the item. Write its algorithm and state its time complexity. The declaration is given as

BSTNode$*$ search$(BSTNode*$ tree, int key$)\{dots...\}$

$($f$)$ Write an algorithm to print the keys of the BST using preorder traversal of the Depth First Search.

The declaration below shows that a binary search tree will be passed as pointer parameter. Most

commonly, the root of the tree will be passed. The declaration is:

void printDFS$\_$PreOrder$($BSTNode$*$ tree$)$

$($g$)$ In the main function, create the root, and the bstree. The first node will be your root node. Insert

the keys from $($a$).$ Search the tree for node with key $11$ and print it$.$