public int sizeLeft () { Node x = root; int sz = 0; while (true) { if (x == null) break; x = x.left; sz = sz + 1; } return sz; }
A variant.