module IntBST:Binary_search_tree.BinarySearchTree(sig
typet =int
val compare : 'a -> 'a -> int
val show : int -> stringend)
include Base
val find : Base.t -> Ord.t -> bool
val height : Base.t -> int
val string_of_tree : t -> string