Definition:
At each level, every node have atmost 2 childs.
Some points:
- Finite(possibly Empty) collection of element.
- A non empty binary tree has a root element.
- The remaining elements(if any) are partitioned into two binary tree.
- These are called the left and right subtree of the tree.
Difference between 'tree' and 'binary tree' :
-No node in a binary tree may have a degree more than 2, whereas there is no limit on the degree of a node in a tree.
-A binary tree may be empty, a tree cannot be empty.
-The subtrees of the Binary tree are ordered while subtree of tree are not ordered.
Also See
Binary search tree