What is Binary tree,Different type of tree in Data structure

Different type of tree in Data structure 

Binary Tree:-

• A Binary tree is a finite set of elements that is either empty or is partitioned into three disjoint subset 

• The First subset contains a single element called the root of the tree

• The other two subsets are themselves binary tree ,called left and right subtrees of the original tree.

• Each element of a binary tree called a node of the tree