I applied online on the Google website and was contacted directly by a recruiter from Google.

She was very helpful and thorough in explaining the steps involved. She also sent me a separate email on how to prepare, though it wasn't overly specific.

She asked for my availability for a phone screen within the next three weeks.

The interview was 45 minutes long and consisted of one situational question followed by two coding questions. There might have been more, had I actually solved the tree-related problem.

Additionally, you are expected to write test cases after your implementation.

Print a binary tree (the way it looks).

Print the root, then print nodes at height 1, then nodes at height 2, and so on.

Convert the string "1234" into a number without using library functions.