There were two interviewers. We greeted each other, then I was asked to give a brief introduction about myself. (I would suggest you to prepare a 1.5-2 min intro beforehand). They then introduced themselves. As I had mentioned a bit about CP in my resume, they asked me about Google Kickstarts and Codejam; we had a general discussion on that. Then I was asked a DSA problem.

Problem : Given a binary tree, we need to delete any leaf node if it has "even" value. Additionally, any node that becomes a leaf node after deletion of some other node should also be considered as a leaf node. Return the remaining binary tree after the process terminates.