I had one technical screen with a senior developer at Google. The first 30 minutes were spent discussing software development methodologies, which went well.

The second half was spent doing technical design over the phone. It mainly involved a discussion of how to solve problems and what data structures I would use.

I didn't think the questions were very difficult, and I'm pretty sure my solutions were correct. However, I guess I didn't do well enough, because I was told I wasn't a fit.

An in-order binary search tree traversal visits nodes in ascending order of their keys.

This is achieved by following these steps:

1. Traverse the left subtree recursively.
2. Visit the current node.
3. Traverse the right subtree recursively.