module RedBlackTree:functor (Ord:Ord.S) ->Binary_search_tree.Make(Ord)(sigtypecolor =
|Red|Blacktypet =
|Empty|Node of{
mutable color :color;value :Ord.t;mutable parent :t;mutable left :t;mutable right :t;}val empty_tree :tval left :t -> tval right :t -> tval value :t -> Ord.tval get_parent :t -> tval get_grand_parent :t -> tval get_uncle :t -> tval rotate_left :t -> unitval rotate_right :t -> unitval rebalance :t -> tval root_of_node :t -> tval insert :t -> Ord.t -> tend)
| Parameters: |
|
include Base
val find : Base.t -> Ord.t -> bool
val height : Base.t -> int
val string_of_tree : t -> string