Rendering the Java heap as a Treemap

a dominator node D of a node A is a node that if removed would make A unreachable

Should this be reversed? If you remove node D in the sample, node A is still reachable by the Root node.

Edit: or perhaps you didn't mean the A and D in the example are the same as A and D in this definition.