Consider the following class to model a node of a BST

class TNode{

public:

int data;

TNode * left;

TNode * right;

Tnode();

TNode(int);

};

Cosider the following class to create a BST

class BST{

public:

Tnode *root;

BST();

void insert(TNode *, int); //to insert a node of given value

bool search(TNode *, int); //to search a node of given value

void delete_node(TNode *, int); //to search and delete a node of given value

bool isEmpty(); //to check if the BST is empty

void in_orderTraverse(TNode*); //to display the values of BST in ascending order

TNode* findmin(TNode*); //to find the minimum value of the given BST or subtree

TNode* getParent(TNode*, int); //to return the parent of a given node

};