Количество узлов BST CPP
int CountNodes(node* root)
{
if (root == NULL) {
return 0;
}
return 1 + CountNodes(root->left) + CountNodes(root->right);
}
Obedient Ostrich