Binary Tree Operations

This module provides operations for manipulating binary trees.

Type Definition

type 'a bin_tree = Nil | Node of 'a * 'a bin_tree * 'a bin_tree

Represents a binary tree where each node contains a value of type 'a and has two child nodes.

val height : 'a bin_tree -> int

Returns the height of the given binary tree.

val nb_leaf : 'a bin_tree -> int

Returns the number of leaves in the given binary tree.

val nb_internal_nodes : 'a bin_tree -> int

Returns the number of internal nodes in the given binary tree.

val internal_nodes : 'a bin_tree -> 'a list

Returns a list of internal nodes in the given binary tree.

val search_node : 'a bin_tree -> 'a -> bool

Checks if the given value exists in the binary tree.

val is_symmetric : 'a bin_tree -> bool

Checks if the binary tree is symmetric.

val is_strict : 'a bin_tree -> bool

Checks if the binary tree is strict.

val is_right_comb : 'a bin_tree -> bool

Checks if the binary tree is a right comb.

val is_left_comb : 'a bin_tree -> bool

Checks if the binary tree is a left comb.

val is_comb : 'a bin_tree -> bool

Checks if the binary tree is a comb.

val is_perfect : 'a bin_tree -> bool

Checks if the binary tree is perfect. ```