int Count(Node root) { if(root == NULL) return 0; return 1 + Count(root->left) + Count(root->right); }
Enter your email address:
No comments:
Post a Comment