The good and bad the op is talking about is different. If the attitude is not the best, you don't hire anyway.
If the candidate cannot invert a binary tree and gets mostly there, and has demonstrable real world software, it's a different thing.
If the candidate cannot invert a binary tree and gets mostly there, and has demonstrable real world software, it's a different thing.
What does that even mean? Swap left-right child nodes? Write it linearly (n-th children at 2n and 2n+1) and reverse it as if it was a string? OP later described it as "to min-max the tree, ascending to descending." confusing me further.