# Data Structure Questions and Answers-Search an Element in a Linked List using Recursion

## Data Structure Questions and Answers-Search an Element in a Linked List using Recursion

 Question 11 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
How many times is the function linear....search() called when the following code is executed?

`#include<stdio.h> #include<stdlib.h> struct Node { int val; struct Node* next; }*head; int linear....search(struct Node *temp, int value) { if(temp == 0) return 0; if(temp->val == value) return 1; return linear....search(temp->next,  value); } int main() { int arr[6] = {1, 2, 3, 4, 5, 6}; int n = 6, i; head = (struct Node*)malloc(sizeof(struct Node)); head->next = 0; struct Node *temp; temp = head; for(i=0; i<n; i++) { struct Node *newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->next = 0; newNode->val = arr[i]; temp->next = newNode; temp = temp->next; } int ans = linear....search(head->next, 6); if(ans == 1) printf("Found"); else printf("Not found"); return 0; }`
 A 5 B 6 C 7 D 8
Question 11 Explanation:
The function linear....search() is called 6 times when the above code is executed.

 Question 12 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the time complexity of the above recursive implementation of linear search?
 A O(1) B O(n) C O(n2) D O(n3)
Question 12 Explanation:
The time complexity of the above recursive implementation of linear search is O(n).

There are 12 questions to complete.