// Struct for nodes of the tree

template

struct node {

T key;

S value;

shared_ptr> child;

shared_ptr> sibling;

node(T key, S value) {

this->key = key;

this->value = value;

child = NULL;

sibling = NULL;

}

};

// Constructor

template

Tree::Tree(shared_ptr> root) {

this->root = root;

}

// This function finds a key in the tree and returns the respective node

template

shared_ptr> Tree::findKey(T key) {

return findKeyHelper(root,key);

}

// Helper function to find a key in the tree

template

shared_ptr> Tree::findKeyHelper(shared_ptr> currNode, T key) {

return NULL;

}

// This function inserts the given node as a child of the given key

template

bool Tree::insertChild(shared_ptr> newNode, T key) {

return false;

}

// This function returns all the children of a node with the given key

template

vector>> Tree::getAllChildren(T key) {

return vector>>();

}

// This function returns the height of the tree

template

int Tree::findHeight() {

return findHeightHelper(root);

}

// Helper function to find height of the tree

template

int Tree::findHeightHelper(shared_ptr> currNode) {

return 0;

}

// This function deletes the node of a given key (iff it is a leaf node)

template

bool Tree::deleteLeaf(T key) {

return false;

}

// Helper function to delete leaf node

template

shared_ptr> Tree::deleteLeafHelper(shared_ptr> currNode, T key) {

return NULL;

}

// This function deletes the tree

template

void Tree::deleteTree(shared_ptr> currNode) {

return;

}

// This function returns the root of the tree

template

shared_ptr> Tree::getRoot() {

return NULL;

}

Code all of these in c++