Reading time: 10 minutes | Coding time: 5 minutes

A binary tree is a tree data structure in which each node has upto two children (that is a maximum of two children nodes), which are referred to as the left child and the right child. Node representation is as follows:

This is a companion discussion topic for the original entry at http://iq.opengenus.org/binary-trees/