A binary tree node has data , pointer to left child and a pointer to right child
class Node { public int data ; public Node left , right ; public Node ( int data , Node left , Node right ) { this . data = data ; this . left = left ; this . right = right ; }