Reversing a binary tree is a real question that gets asked in interviews: https://leetcode.com/problems/invert-binary-tree/
It’s actually pretty easy if you’re comfortable with recursion and traversing trees. The tree questions Google asks in its interviews are usually much harder- it implies they were giving softball questions to him.
Re:Code Interviews
by pseudalopex on Monday September 06, 2021 @03:44PM
(#28437217)
Knowing Homebrew could have given them reasons not to hire him. He made bad engineering decisions and brushed off feedback. And even he said he's a dick.
(1) Most of Google's engineers didn't even know Homebrew - it just wasn't something Google used on its notebooks.
(2) There's no such thing as "inverting a binary tree." At least I haven't heard about it anywhere else.
Maybe Google's interview process is broken, but the tweet isn't really explaining much. It's just a nice soundbite.