Why do we need the entropy of parent node in the Information Gain. Information Gain = entropy(parent) - w * entropy(children)
We can compare the entropy of the children without the need for the parent entropy.
It's essential; you're computing gain from the parent to the same data split in the children! Not comparing children. A good split takes a high-entropy data set (lots of several different labels) and turns it into lower-entropy data sets (some labels on one child mostly, other labels on the other).