C++ assignment help to count number of nodes in a binary searchtree : /********************************************************You may assume that the following Node class has already beendefined for you previously: class Node { public: Node *left,*right; Node() { left = right = nullptr; } ~Node() { delete left;left = nullptr; delete right; right = nullptr; } }; You may alsoassume that iostream has already been included. Implement thefunction “int count(Node *n)” below to return an integerrepresenting the number of nodes in the subtree of Node n(including Node n itself).*********************************************************/ intcount(Node *n) { // Implement count() here. return 0; } int main(){ Node *n
OR
OR