Internals of ISet and IMap, usable as generic tree library
val empty : 'a tree
val is_empty : 'a tree -> bool
create l v r is similar to
make_tree l v r but performs no rebalancing; in other words, you should use this only when you know that
r are already balanced.
val height : 'a tree -> int
val root : 'a tree -> 'a
- raises Not_found
if the tree is empty
val singleton_tree : 'a -> 'a tree
val iter : ('a -> unit) -> 'a tree -> unit
val fold : ('a -> 'b -> 'b) -> 'a tree -> 'b -> 'b
val check : 'a tree -> bool
Check that the tree is balanced according to the AVL tree rules. An AVL tree is balanced when for every node the height of the subnodes differs by at most 1.
- since 2.3.0