- Make the mirror image of the given binary tree.
- Design the data structure and algorithm to help in spell correction of words. The correct words are given in alphabetical order in the dictionary file.
- Write a function which tests whether the given binary tree is a binary search tree or not?
- Merge two given BSTs in linear time.
- Using getchar() take user input until user presses Enter key. And then print the user input in the reverse order.
Here, I post stuff that i have got chance to explore. I put in the links to the articles that i find most suitable, and as i explore the topic more i add my own comments as well.
Saturday, 27 October 2012
Microsoft Interview Questions
Labels:
interview question,
microsoft
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment