anchor.diff:              printfn "Found %A in tree!" value
               true
           else
  -            if tree.Value < value then
  +            if value < tree.Value then
                   // Recursion on the left subtree
                   search value tree.Left
               else
  
positive.code:         |> insert 16
          |> insert 2
          |> insert 7
  
      List.iter (fun elem -> printfn "%A" elem) <| in_order_traversal tree
      0
  
negative.code:                 Some { tree with Right = delete value tree.Right }
      | None ->
          // Value not found
          printfn "Value %A not found in tree..." value
          None
  
  (*
  