anchor.diff:                    % need to hash here since we won't keep the bucket!
                     Hash = run_leaf_hf(lists:ukeysort(1, Bucket), Interval,
                                        Config#mt_config.leaf_hf),
  -                  {Hash, Count, 0, [], Interval, []}
  +                  {Hash, Count, 1, [], Interval, []}
              end,
       build_childs(T, Config, [Node | Acc]);
   build_childs([], _, Acc) ->
  
positive.code: 
  -type mt_node() :: { Hash        :: mt_node_key() | nil, %hash of childs/containing items
                       Count       :: non_neg_integer(),   %in inner nodes number of subnodes including itself, in leaf nodes number of items in the bucket
                       LeafCount   :: -1 | non_neg_integer(), % -1 if not hashed yet, otherwise the number of leafs below this node (if it is a leaf, LeafCount will be 0)
                       Bucket      :: mt_bucket(),         %item storage
                       Interval    :: mt_interval(),       %represented interval
                       Child_list  :: [mt_node()]
  
negative.code:     % leaf node, no bucket contents, keep_bucket true
      Bucket1 = lists:ukeysort(1, Bucket),
      Hash = run_leaf_hf(Bucket1, Interval, LeafHf),
      {Hash, Count, 1, ?IIF(CleanBuckets, [], Bucket1), Interval, Childs}.
  
  %% @doc Hashes an inner node based on its childrens' hashes.
  -spec run_inner_hf([mt_node(),...], InnerHf::inner_hash_fun()) -> mt_node_key().
  