return tree == NULL ? -1 : tree->height;
I am trying to understand AVL trees but the one really nice example I found has a couple of methods defined like this. It is really pretty but I cannot read it? Can someone explain it to me? Or even just write it out in a more verbose C++