Understanding a binary tree

A tree is a nonlinear data structure that stores elements hierarchically. Every element in a tree is called a node, and except the topmost node, each node has a parent node and zero or more children nodes. The individual nodes in a tree are connected by edges, which may be unidirectional or bidirectional. A tree can only have edges between a parent and a child node, and therefore, a tree cannot have cycles.