Skip to content

Comment on Code Interviewsparent

Comments

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.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.