anchor.diff:                  search value tree.Right
       | None ->
           // Value not found
  -        printfn "Value %A not found in tree..." tree.Value
  +        printfn "Value %A not found in tree..." value
           false
   
   // Main program logic
  
positive.code:             printfn "Found %A in tree!" value
              true
          else
              if tree.Value < value then
                  // Recursion on the left subtree
                  search value tree.Left
              else
  
negative.code: 
  (*
  Delete operation
  Complexity: O(n log n)
  *)
  let rec delete value tree : BST<'a> Option =
      match tree with
  