Question

C++

Consider the following structure of node and linked list.

struct Node {
  int key;
  Node *next;
};

10 -> 20 -> 30 -> 10 -> 10 -> 50 -> 10 -> NULL

What will be the output of following pseudo-code? Consider head is the pointer to the first node of above linked list.

Node *walker = head;
int count = 0;
while(walker!= NULL && count < 3) {
        if(walker->key == 10) {
                 count = count + 1;
         }
         walker = walker->next;
}
cout <<  walker->key  << endl;

Answer 1

Answer is 50 ..

because each time walker key is equal to 10 count is incremented in while loop

and we have a condition in while loop that says count needs to be less than 3 .

So when we got to 3rd 10 in linked list count becomes 3 so that is the final iteration .

next statement after if block is while moves the walker to next node

so at the end of while loop walker points to node after the 3rd 10 i..e 50 .

so walker.key prints 50