Binary tree in C

A binary tree is made by series of nodes, where each node contains a "left" reference, a "right" reference, and a data element. The top most node is the root of the tree. Every node in a tree is connected by a directed edge from exactly one other node, that's know as parent. On the other hand, each node can be connected to arbitrary number of nodes, called children. Nodes with no children are called leaves, or external nodes. Nodes which are not leaves are called internal nodes. Nodes with the same parent are called siblings.

Click here for Binary tree in C