anchor.diff:                                                                                                         end
                                                                                                  end,
                                                                                     {KeyValuesSplit, TreesSplit} = split_tree_non_root(TreeUpper, KeyNoSplit, KeyValues, Trees, TreeUpperPos),
  -                                                                                  {none, TreeUpperPosSplit} = search(Key, KeyValuesSplit, length(KeyValuesSplit)),
  +                                                                                  KeyNoEff = length(KeyValuesSplit),
  +                                                                                  {none, TreeUpperPosSplit} = binary_search(Key, KeyValuesSplit, KeyNoEff, 1, KeyNoEff),
                                                                                     {lists:nth(TreeUpperPosSplit, TreesSplit), KeyValuesSplit, TreesSplit, TreeUpperPosSplit};
                                                                                 _ ->
                                                                                     {TreeUpper, KeyValues, Trees, TreeUpperPos}
  
positive.code: -spec lookup_1(key(), tree()) -> 'none' | {'value', value()}.
  
  lookup_1(Key, {KeyNo, IsLeaf, KeyValues, ChildTrees}) ->
      {Value, Pos} = search(Key, KeyValues, KeyNo),
      case Value == none of
          true ->
              case IsLeaf of
  
negative.code:     values/1
  ]).
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
  %% Data structure:
  %% - {BTreeType, Minimum, Maximum, NumberKeyValues, Tree}, 
  