anchor.diff:      //
       static member private mkt_bal_l (n, l, r : AvlTree<'T>) =
           // Preconditions
  -        assert (AvlTree.AvlInvariant l)
  -        assert (AvlTree.AvlInvariant r)
  -        assert (AvlTree.Height l <= AvlTree.Height r + balanceTolerance)
  +        //assert (AvlTree.AvlInvariant l)
  +        //assert (AvlTree.AvlInvariant r)
  +        //assert (AvlTree.Height l <= AvlTree.Height r + balanceTolerance)
   
           if AvlTree.Height l = AvlTree.Height r + balanceTolerance then
               match l with
  
positive.code:                             AvlTree.Create (rn, rlr, rr))
          else
              AvlTree.Create (n, l, r)
              |> tap (fun x -> assert (AvlTree.AvlInvariant x))
  
      /// Join two trees together with the specified root element.
      /// Takes two trees representing disjoint sets and combines them, returning
  
negative.code:     //
      let rec internal (*private*) find_del_right p (tree : CharDiet) : char * CharDiet =
          // Preconditions
          //assert (dietInvariant tree)
          //assert (fst <| intervalsDisjoint tree Set.empty)
  
          match tree with
          | Empty ->
  