### Binary search tree node count [closed]

Node *newnode(int item) { Node *temp = new Node(); temp->data = item; temp->left = temp->right = NULL; return temp; } Node* insert(Node*node, int data) { if (node == NULL) { return newnode(data); } if (data < node->data) { node->left = insert(node->left, data); } else { node->right = insert(node->right, data); } return node; } void inorder(Node*root)…

Details