View Allnum of numClose (Esc) GoogleClaim this company Company Overview FAQOverview Overview 16k Reviews 3.0k Jobs 38k Salaries 12k Interviews 4.4k Benefits 381 PhotosAdd an InterviewView Jobs at Google
Interview QuestionSoftware Engineer InterviewGoogleFind the deepest node of a binary tree. If multiple nodes are at the deepest level, then return the rightmost node. Tags: See More, See Less8AnswerAdd TagsFlag as InappropriateFlag as InappropriateAnswerInterview Answer 1 Answer▲0▼ it actually just sounds like a BFS, then return the last node you popped - assuming you enqueued left then right. Anonymous on 28 Nov 2014Flag as InappropriateFlag as InappropriateInterviews > Software Engineer > GoogleAdd Answers or Comments To comment on this, Sign In or Sign Up.
it actually just sounds like a BFS, then return the last node you popped - assuming you enqueued left then right.