Sir, it looks like number of connected components in which we have to divide is fixed. suppose if we have B number of black vertex in it ,so problem is to find no of ways to delete B-1 edges such that each component has exactly one black node .
Please clarigy it.
Appleman and tree problem statement
Yes your observation is correct, you need to find the ways to delete B-1 edges such that each of the B trees left after the edges have been deleted contain exactly 1 black node.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.