I received a call from Yahoo after applying on their job site.

There were two phone interviews, and then I was called onsite.

The phone interviews were pretty basic and covered material I had mentioned on my resume, along with basic C++ and Unix questions.

The onsite interviews were above average.

I was asked about all traversal types of a binary tree.

Questions were asked about some Unix tools and shell scripting.

There were also a couple of C++ string manipulation problems.

Write a routine to reverse a string and then reverse only the individual words in the same string using the routine.

Explain all traversal types of a Binary Tree.

• In-order Traversal:

  • Traverses the left subtree, then the root, then the right subtree.
  • For a Binary Search Tree, this traversal visits nodes in ascending order.

• Pre-order Traversal:

  • Traverses the root, then the left subtree, then the right subtree.
  • Useful for creating a copy of the tree or for expression trees.

• Post-order Traversal:

  • Traverses the left subtree, then the right subtree, then the root.
  • Useful for deleting nodes or evaluating expression trees.