Practicing for Linkedlist-Length-Recursion of Algorithms

Questions 1 of 10
  • Q. Consider the following iterative implementation used to find the length of a linked list:
    struct Node{
      int val;
      struct Node *next;
    }*head;
    int get_len(){
      struct Node *temp = head->next;
      int len = 0;
      while(_____){
       len++;
       temp = temp->next;
      }
      return len;
    }
    Which of the following conditions should be checked to complete the above code?