Binary tree is a finite set of elements called nodes such that is
It may be empty or it is partitioned into three disjoint subsets there is a single distinguished element called the root of tree others two subsets are binary tree called left subtree and right subtree
E= (a+b)/ [(c*d)-e]
