A binary tree is a way of organizing data in a hierachical structure. It consist of nodes where each node can have atleast two children. we call this children as left child and right child. The node at the very top of the tree is called the root node
- Path:Npath refers to the sequence of nodes along the edes of a tree
- Root: The node at the top of the tree is called the root. Therfe is only one root per tree
- Parent: Any node except the root node has one edge upward to a node called the parent