anchor.diff:      {One, no_conflicts} = merge(One, One),
       {TwoChild, no_conflicts} = merge(TwoChild, TwoChild),
       {TwoChildSibs, no_conflicts} = merge(TwoChildSibs, TwoChildSibs),
  +    {TwoChildSibs, no_conflicts} = merge(TwoChildSibs, Stemmed1b),
  +    {TwoChildSibs, no_conflicts} = merge(Stemmed1b, TwoChildSibs),
  +    {TwoChildSibs2, no_conflicts} = merge(TwoChildSibs2, Stemmed1bb),
  +    {TwoChildSibs2, no_conflicts} = merge(Stemmed1bb, TwoChildSibs2),
       {TwoChild, no_conflicts} = merge(TwoChild, Stemmed1aa),
       {TwoChild, no_conflicts} = merge(TwoChild, Stemmed1a),
       {Stemmed1a, no_conflicts} = merge(Stemmed1a, Stemmed1aa),
  
positive.code:     TwoChild = [{0, {"1","foo", [{"1a", "bar", [{"1aa", "bar", []}]}]}}],
      TwoChildSibs = [{0, {"1","foo", [{"1a", "bar", []},
                                       {"1b", "bar", []}]}}],
      Stemmed1a = [{1, {"1a", "bar", [{"1aa", "bar", []}]}}],
      Stemmed1aa = [{2, {"1aa", "bar", []}}],
      
      {EmptyTree, no_conflicts} = merge(EmptyTree, EmptyTree),
      {One, no_conflicts} = merge(EmptyTree, One),
  
negative.code:         {ok, [{Key, Value, Merged} | Sibs], Conflicts};
      no ->
          case merge_at(Sibs, Place, Insert) of
          {ok, Merged, Conflicts} ->
              {ok, [{Key, Value, SubTree} | Merged], Conflicts};
          no ->
              no
          end
  