anchor.diff:      TwoChild = [{0, {"1","foo", [{"1a", "bar", [{"1aa", "bar", []}]}]}}],
       TwoChildSibs = [{0, {"1","foo", [{"1a", "bar", []},
                                        {"1b", "bar", []}]}}],
  +    TwoChildSibs2 = [{0, {"1","foo", [{"1a", "bar", []},
  +                                     {"1b", "bar", [{"1bb", "boo", []}]}]}}],
  +    Stemmed1b = [{1, {"1a", "bar", []}}],
       Stemmed1a = [{1, {"1a", "bar", [{"1aa", "bar", []}]}}],
       Stemmed1aa = [{2, {"1aa", "bar", []}}],
  +    Stemmed1bb = [{2, {"1bb", "boo", []}}],
       
       {EmptyTree, no_conflicts} = merge(EmptyTree, EmptyTree),
       {One, no_conflicts} = merge(EmptyTree, One),
  
positive.code:     {One, no_conflicts} = merge(One, One),
      {TwoChild, no_conflicts} = merge(TwoChild, TwoChild),
      {TwoChildSibs, no_conflicts} = merge(TwoChildSibs, TwoChildSibs),
      {TwoChild, no_conflicts} = merge(TwoChild, Stemmed1aa),
      {TwoChild, no_conflicts} = merge(TwoChild, Stemmed1a),
      {Stemmed1a, no_conflicts} = merge(Stemmed1a, Stemmed1aa),
  
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
  