First Question: Implement a stack using 2 queues. You can start by doing the brute force method but the interviewer expects you to provide the most efficient algorithm.
Second Question: The interviewer asked me to write the exact code of how to find the inorder successor of a node in a Binary Search Tree. Also, he asked me the running order of the code that I wrote.

Question

First Question: Implement a stack using 2 queues. You can start by doing the brute force method but the interviewer expects you to provide the most efficient algorithm.
Second Question: The interviewer asked me to write the exact code of how to find the inorder successor of a node in a Binary Search Tree. Also, he asked me the running order of the code that I wrote.

Yahoo

Question d’entretien chez Yahoo

Entreprises suivies

Recherche d’emplois