Leetcode 250 - code review snippet

Leetcode250_codereview.java

 cur.size = left.size + right.size;   

  cur.isUnival  = (left.IsUnival && right.IsUniVal &&
     (root.left == null   || (root.left.val == root.val)) &&
     (root.right == null || (root.right.val == root.val);

   if(cur.isUnival)
   { 
     cur.size += 1; 
   }   

  return cur;