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