C$++,$ Visual Studio. I$\text{'}$m working on a project with a header file BinaryNodeTree.h$.$ I want it implemented into a $.$cpp file. I attached the header file below but due to some weird issue on this site it takes out the template and the includes. It includes memory and the template is class ItemType. I would appreciate a practical complete implementation and comments. BinaryNodeTree.h: #ifndef BINARY$\_$NODE$\_$TREE$\_$

#define BINARY$\_$NODE$\_$TREE$\_$

#include "BinaryTreeInterface.h$"$

#include "BinaryNode.h$"$

#include "PrecondViolatedExcept.h$"$

#include "NotFoundException.h$"$

#include

template

class BinaryNodeTree : public BinaryTreeInterface

$\{$

private:

std::shared$\_$ptr$>$ rootPtr;

protected:

int getHeightHelper$($std::shared$\_$ptr$>$ subTreePtr$)$ const;

int getNumberOfNodesHelper$($std::shared$\_$ptr$>$ subTreePtr$)$ const;

auto balancedAdd$($std::shared$\_$ptr$>$ subTreePtr, std::shared$\_$ptr$>$ newNodePtr$)$;

virtual auto removeValue$($std::shared$\_$ptr$>$ subTreePtr, const ItemType target, bool& isSuccessful$)$;

auto moveValuesUpTree$($std::shared$\_$ptr$>$ subTreePtr$)$;

virtual auto findNode$($std::shared$\_$ptr$>$ subTreePtr, const ItemType& target, bool& isSuccessful$)$ const;

auto copyTree$($const std::shared$\_$ptr$>$ oldTreeRootPtr$)$ const;

void destroyTree$($std::shared$\_$ptr$>$ subTreePtr$)$;

void preorder$($void visit$($ItemType&$),$ std::shared$\_$ptr$>$ treePtr$)$ const;

void inorder$($void visit$($ItemType&$),$ std::shared$\_$ptr$>$ treePtr$)$ const;

void postorder$($void visit$($ItemType&$),$ std::shared$\_$ptr$>$ treePtr$)$ const;

public:

BinaryNodeTree$()$;

BinaryNodeTree$($const ItemType& rootItem, const std::shared$\_$ptr$>$ leftTreePtr, const std::shared$\_$ptr$>$ rightTreePtr$)$;

BinaryNodeTree$($const std::shared$\_$ptr$>$& tree$)$;

virtual ~BinaryNodeTree$()$;

bool isEmpty$()$ const;

int getHeight$()$ const;

int getNumberOfNodes$()$ const;

ItemType getRootData$()$ const throw$($PrecondViolatedExcept$)$;

void setRootData$($const ItemType& newData$)$;

bool add$($const ItemType& newData$)$;

bool remove$($const ItemType& data$)$;

void clear$()$;

ItemType getEntry$($const ItemType& anEntry$)$ const throw$($notFoundException$)$;

bool contains$($const ItemType& anEntry$)$ const;

void preorderTraverse$($void visit$($ItemType&$))$ const;

void inorderTraverse$($void visit$($ItemType&$))$ const;

void postorderTraverse$($void visit$($ItemType&$))$ const;

BinaryNodeTree& operator$=($const BinaryNodeTree& rightHandSide$)$;

$\}$;

#include "BinaryNodeTree.cpp$"$

#endif