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