The Newick notation with the “trunk” in the middle is not unique. For example, we could write the given tree as (A(C(E,G,F)D)B); or as (B(C(E,G,F)D)A); so swapping taxa A and B. In fact, this can be done for any pair that is on the same “level”. Multiple questions arise from this:

  • If we have k nodes with two leaves as children, how many such “swaps” do we have?
  • What about the one node with 3 leaves as children?