Tree

Definition: A non-linear data structure is called tree.

Note : 

👉 The line drawn from a node N of tree T to a successor (child) is called an edge

👉 A binary tree is defined as a finite set of element is called nodes.

👉 Those nodes which have no parent is called root node.

👉 Those node which have no child is called leaf node.