module BinarySearchTree: functor (Ord : Ord.S) -> Make(Ord)(sig
type
| |
Empty |
| |
Node of {
|
value : Ord.t; |
|
left : t; |
|
right : t; |
}
|
val empty_tree : t
val left : t ->
t
val right : t ->
t
val value : t -> Ord.t
val insert : t ->
Ord.t -> t
end)
include Base
val find : Base.t -> Ord.t -> bool
val height : Base.t -> int
val string_of_tree : t -> string