A memoization function returns size of the largest independent set in a given binary tree
static int liss ( node root ) { if ( root == null ) return 0 ; if ( root . liss != 0 ) return root . liss ; if ( root . left == null && root . right == null ) return root . liss = 1 ;