anchor.diff:  
   % Leaf node.
   insert_1(KeyValue, {KeyNo, 0, KeyValues, []}, _, _) ->
  -    {KeyNo + 1, 0, insert_key_value(KeyValue, KeyValues, []), []};
  +    {KeyNo + 1, 0, insert_key_value(KeyValue, KeyValues, KeyNo), []};
   insert_1({Key, _} = KeyValue, {KeyNo, SubtreeNo, KeyValues, Subtrees}, SubtreeNoMin, KeyNoMax) ->
       {ValueFound, SubtreePos} = binary_search(Key, KeyValues, KeyNo, 1, KeyNo),
       case ValueFound of
  
positive.code:         _ ->
              {value, Value}
      end.
  
  %%direct_test() ->
  %%
  %%%%    ?assertEqual(?B_TREE_04_64_MINUS_32, b_trees:delete("k_32", ?B_TREE_04_64)),
  %%
  %%%%    ?debugFmt("wwe debugging direct_test ===> ~n Result: ~p~n", [b_trees:delete("k_22", ?B_TREE_WWE)]),
  %%
  %%%%    ?assertEqual(?B_TREE_04_32_MINUS_07_01_05, b_trees:delete("k_05", ?B_TREE_04_32_MINUS_07_01)),
  %%
  %%%%    Number = 64,
  %%%%
  %%%%    _Keys = test_generator:generate_keys_random(Number, 2),
  %%%%
  %%%%    _Btree = test_generator:generate_b_tree_from_number(4, Number, 2),
  %%%%
  %%%%    ?assertEqual(b_trees:empty(4), test_generator:delete_b_tree_list(_Keys, _Btree)),
  %%
  %%    ok.
  
negative.code:                                                           end}
      end;
  delete(Key, {SubtreeNoMin, KeyNoMax, NumberKeyValues, Tree} = _BTree) ->
      {SubtreeNoMin, KeyNoMax, NumberKeyValues - 1, delete_1(Key, Tree, SubtreeNoMin, KeyNoMax)}.
  
  -spec combine(tree(), tree()) -> tree().
  
  combine({LeftKeyNo, 0, LeftKeyValues, []} = _LeftTree, {RightKeyNo, 0, RightKeyValues, []} = _RightTree) ->
      {
          LeftKeyNo + RightKeyNo,
          0,
  