The class BST creates binary search trees by using dynamic nodes that have two pointers, one for the right child and one for the left child.The member variables of the class are:A pointer named root that points to the root of the treethe root is a dynamic object of type Node.A variable of type int named count that keeps track of the number of nodes in the tree.The class BST uses the class Node, which includes the class BST as a friend class. This will allow you to access the private member variables of the class Node directly, simplifying the implementation when using pointers.