Tree where each node has up to two leaves.
A binary tree is simply a tree in which each node can have at most two children.
A binary search tree
It is a binary tree in which the nodes are assigned values, with the following restrictions ;
-No duplicate values.
-The left subtree of a node can only have values less than the node
-The right subtree of a node can only have values greater than the node