In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
- binary_tree_node - Create a new node, it can be the root node.
- binary_tree_insert_left - Create a node as the left-child of another node.
- binary_tree_insert_right - Create a node as the right-child of another node.
- binary_tree_delete - Deletes an entire binary tree.
- binary_tree_is_leaf - Checks if a node is a leaf.
- binary_tree_is_root - Checks if a node is a root.
- binary_tree_preorder - Goes trought the tree using pre-order transversal.
- binary_tree_inorder - Goes trought the tree using inorder transversal.
- binary_tree_postorder - Goes trought the tree using postorder transversal.
- binary_tree_height - Return the tree height.
- binary_tree_depth - Return the depth of a node.
- binary_tree_size - Return the tree size.
- binary_tree_leaves - Return the number of leaves on the tree.
- binary_tree_nodes - Return the number of nodes with at least 1 child.
- binary_tree_balace - Measures the balance factor of a binary tree.
- binary_tree_is_full - Checks if a binary tree is full.
- binary_tree_is_perfect - Checks if a binary tree is perfect.
- binary_tree_sibling - Finds the sibling of a node.
- binary_tree_uncle - Finds the uncle of a node.