think about decomposition if one of those components is deleted:
(D:0,(A:0,B:0));
if we "leave the comma in" (comment Manja) we should be able to decompose tree by only storing parent node and NOT by storing all nodes to root (i.e. the "letters" only remember the closest "opening bracket" (which corresponds to the parent internal node)
(D:0,C:0(A:0,B:0));
think about decomposition if one of those components is deleted:
(D:0,(A:0,B:0));
if we "leave the comma in" (comment Manja) we should be able to decompose tree by only storing parent node and NOT by storing all nodes to root (i.e. the "letters" only remember the closest "opening bracket" (which corresponds to the parent internal node)