Isn't the binary tree question more of a "low-pass filter"? As in, if someone can't even do that, they don't get as far as the interview where you talk about architecture and other cool things?
I could figure it out, but the issue is that it will take time, and it is stressful. A new college grad by contrast still remembers Data Structures 101, and how to manipulate trees. This kind of "bozo filter" favors both new grads, and people who spend a lot of time memorizing trivia in order to solve these problems quickly.
"Invert a binary tree" like questions just filter out anyone who hasn't recently graduated with a CS degree or recently and deliberately studied algorithms. I don't think they're that useful if you want to find a leader.