Data Structures & Algorithms Course: Binary Search Tree using Recursion

Write the countPNodes member function of the Binary Search Tree ADT and its recursive helper to count the number of nodes with two children. Assume the standard linked-structure implementation for BST. struct BTNode { int value: BTNode* left: BTNode* right: } class BinarySearchTree { private: BTNode* root: public: //... } int BinarySearchTree:: countPNodes () {