anchor.diff:          MbrAndPos = seedtree_write_finish(NewChildren);
       HeightDiff > 0 ->
           ok = foo;
  -    % insert tree is too height => use its children
  +    % insert tree is too high => use its children
       HeightDiff < 0 ->
           % flatten the OMT tree until it has the expected height to be
           % inserted into the target tree (one subtree at a time).
  
positive.code:     ?assertEqual(1051, length(Lookup5)).
  
  
  seedtree_write_case2() ->
      % Test "Case 2: input R-tree is not shorter than the level of the
      % target node" (chapter 6.2)
      % Test 2.1: input tree is too height
      TargetTreeNodeNum = 25,
      % NOTE vmx: wonder why this tree is not really dense
      {ok, {Fd, {RootPos, TargetTreeHeight}}} = vtree_test:build_random_tree(
              "/tmp/seedtree_write.bin", TargetTreeNodeNum),
  
      ?debugVal(RootPos),
      Nodes1 = lists:foldl(fun(I, Acc) ->
          {NodeId, {NodeMbr, NodeMeta, NodeData}} =
              vtree_test:random_node({I,27+I*329,45}),
          Node = {NodeMbr, NodeMeta, {[NodeId, <<"bulk">>], NodeData}},
          [Node|Acc]
      end, [], lists:seq(1,12)),
  
      Seedtree1 = seedtree_init(Fd, RootPos, 1),
      ?debugVal(Seedtree1),
  
negative.code:         ?debugVal(OmtTrees),
  
          % Insert the OMT trees one by one
          MbrAndPos2 = seedtree_write_insert(Fd, Orig, OmtTrees),
          {NewMbrs, NewPos} = lists:unzip(MbrAndPos2),
          ?debugVal({NewMbrs, NewPos}),
  
  