C++ algorithm for finding the parent of the following left child right sibling tree.The function should take in the pointer to the root of the tree and the key of the child

It should return a pointer to the parent

struct node { T key; S value; node* child; node* sibling; node(T key, s value) { this->key = key; this-> value = value; child = NULL; sibling = NULL; }