Now implement a binary search tree class “BST” which contains root of type TNode as data member. You have to implement the following member functions for your binary search tree: a. A default ...

This setup is crucial for the algorithm to efficiently locate the desired element.### *Use iterative or recursive approach:Choose between an iterative loop or recursion to implement the search.

The BSTN class represents a Binary Search Tree Node (BSTN) and contains private data members for the key, left node (L), and right node (R). The public access contains the function declarations for ...