Nodes are sorted in descending order, i.e., nodes with a higher weight (and consequently larger
area in the tree map) are placed first.
The sum of the child weights is used as the weight value for nodes that have children.
To sort nodes in ascending order, subclass this Comparator and swap the sign of the
comparison method return value.