anchor.diff:                              end, 0, ChildList),
       Hash = run_inner_hf(NewChilds, InnerHf),
       {Hash, Count, LeafCount, [], Interval, NewChilds};
  -gen_hash_node({Hash, _Cnt, _LCnt = 0, _Bkt, _I, []} = N, _InnerHf,
  +gen_hash_node({Hash, _Cnt, _LCnt = 1, _Bkt, _I, []} = N, _InnerHf,
                 _LeafHf, false, _CleanBuckets) when Hash =/= nil ->
       % leaf node, no bucket contents, keep_bucket false
       % -> we already hashed the value in bulk_build and cannot insert any more
  
positive.code:                   % 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, []}
             end,
      build_childs(T, Config, [Node | Acc]);
  build_childs([], _, Acc) ->
  
negative.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 | pos_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()]
  