Isek7/binary_trees

A binary tree is a type of tree data structure in which each node can have at most two children, known as the left child and the right child. A binary tree can be used for various applications, such as searching, sorting, and implementing heap data structures. There are different types of binary trees, such as full, perfect, complete, degenerate...

C