A Binary Tree comes under one of the types of data structure Non-Linear Lists. In this list, the data elements are not stored sequentially.

In a binary tree, the nodes are connected in a particular way which makes the search operation of the data very easy. Both the nodes have one or two child nodes, creating the branches of the tree. The child nodes on the left are called the left nodes and on the right are called the right nodes, and the top node is called the Root Node. The number of levels in the binary tree is called the height of the tree.

BY Best Interview Question ON 02 Feb 2019