[gsylvie]

He just got unlucky. It's always luck of the draw with job interviews. Just like those poker players that say they should have won the hand.

I'd like to try this in an interview: how would you re-root a binary tree such that the ordering of the elements remains the same, but the root node of the tree changes.

[dilyevsky]

+1 imo luck plays larger role than most people would like to admit. Particularly at places like Google who just throw their CS bingo bonanza at you, but at places that interview properly too.

[sirmarksalot]

So implement "rotateToTop" in an AVL tree?