Binary Trees: Introduction

A binary tree is a special data structure in which each node has at most two children. These are mostly referred to as the left child and right child. They are used for storing data. Binary trees are also called bifurcating arboresence.