#include

#include

#include

#include $"$BST$.$h$"$

$//***$do not change the headers$***$

$//$ you solutions go here

$//$ remember that you do not need to implement all of them

$//$ follow the document to see which ones you need to implement

BST::BST$()\{$

$\}$

BST::~BST$()\{$

$\}$

std::shared$\_$ptr BST::search$($int target$)\{$

return nullptr;

$\}$

std::shared$\_$ptr BST::search$($std::shared$\_$ptr n$,$ int target$)\{$

return nullptr;

$\}$

std::shared$\_$ptr BST::minimum$()\{$

return nullptr;

$\}$

std::shared$\_$ptr BST::minimum$($std::shared$\_$ptr n$)\{$

return nullptr;

$\}$

std::shared$\_$ptr BST::maximum$()\{$

return nullptr;

$\}$

std::shared$\_$ptr BST::maximum$($std::shared$\_$ptr n$)\{$

return nullptr;

$\}$

void BST::insertValue$($int val$)\{$

$\}$

std::shared$\_$ptr BST::insertValue$($std::shared$\_$ptr n$,$ int val$)\{$

return nullptr;

$\}$

void BST::deleteValue$($int val$)\{$

$\}$

std::shared$\_$ptr BST::deleteValue$($std::shared$\_$ptr n$,$ int val$)\{$

return nullptr;

$\}$

bool BST::isBST$($std::shared$\_$ptr n$)\{$

return false;

$\}$

bool BST::isBST$($std::shared$\_$ptr n$,$ int low, int high$)\{$

return false;

$\}$

void BST::preOrder$($std::shared$\_$ptr n$,$ std::vector$>$ &order$)\{$

$\}$

void BST::inOrder$($std::shared$\_$ptr n$,$ std::vector$>$ &order$)\{$

$\}$

void BST::postOrder$($std::shared$\_$ptr n$,$ std::vector$>$ &order$)\{$

$\}$

Assignment Questions $(95$ pts$)$

Implement the insert method for binary search trees. Do not insert duplicate

values.

Implement the search method for binary search trees.

Implement isBST, a method for checking whether or not a tree is a binary

search tree.

Implement the pre$-$order traversal method for binary search trees.

How do I do this in C$++?$