Yahoo Interview Question for Software Engineer / Developers

Comment hidden because of low score. Click to expand.
of 2 vote

Node * KthSmallest(Node *n, int k)
    int leftCount;
    if (n->pLeft == NULL)
        leftCount = 0;
        leftCount = n->pLeft->count;

    if (leftCount + 1 == k) return n;
    if (leftCount + 1 < k) return KthSmallest(n->pRight, k - 1 - leftCount);
    return KthSmallest(n->pLeft, k);

In main() call

Node *pSolution = KthSmallest(pRoot, inOrderNumber);

- czpete October 11, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 vote

There is really no point for recursion here. I think that using recursion at these places is actually not a good practice. Though on a similar lines using iteration, this code looks more efficient to me:

Nodeptr nthInInorder(Nodeptr root, int x){
 Nodeptr curr = root;
 int countedIn = 0, leftchildren = 0, currIn=0;

  if(curr->left == NULL)
   leftchildren = 0;
   leftchildren = (curr->left)->data + 1;

  currIn = countedIn + leftchildren + 1;

  if(currIn == x)
   return curr;
  else if(currIn > x)
   curr = curr->left;
  else if(currIn < x)
   { countedIn = currIn + 1;
     curr = curr->right;
  return NULL;

- nosyDeveloper January 27, 2013 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More