Reversing a binary tree is a real question that gets asked in interviews: https://leetcode.com/problems/invert-binary-tree/ https://leetcode.com/problems/invert

Reversing a binary tree is a real question that gets asked in interviews: https://leetcode.com/problems/invert-binary-tree/ 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.