A binary tree tNode has data , a pointer to left child and a pointer to right child
class tNode { int data ; tNode left , right ; tNode ( int item ) { data = item ; left = right = null ; } } class BinaryTree { tNode root ;