the binary tree trees can come in many different shapesand they can vary in the number of children allowed per node or in the way they organize data values within the nodes one of the most commonly used trees in computer science is the binary tree binary tree is tree in which each node can have at most two children one child is identified as the left child and the other as the right child in the remainder of the we focus on the use and construction of the binary tree in the next we will continue our discussion of binary trees but also explore other types properties binary trees come in many different shapes and sizes the shapes vary depending on the number of nodes and how the nodes are linked figure illustrates three different shapes of binary tree consisting of nine nodes there are number of properties and characteristics associated with binary treesall of which depend on the organization of the nodes within the tree ( (ba (cf level ii level level level level level level level figure three different arrangements of nine nodes in binary tree tree size the nodes in binary tree are organized into levels with the root node at level its children at level the children of level one nodes are at level and so on in