# Javascript Program For Searching An Element In A Linked List

Last Updated : 15 Jun, 2022

Write a function that searches a given key ‘x’ in a given singly linked list. The function should return true if x is present in linked list and false otherwise.

bool search(Node *head, int x)

For example, if the key to be searched is 15 and linked list is 14->21->11->30->10, then function should return false. If key to be searched is 14, then the function should return true.
Iterative Solution:

1) Initialize a node pointer, current = head.
2) Do following while current is not NULL
a) current->key is equal to the key being searched return true.
b) current = current->next
3) Return false

Following is iterative implementation of above algorithm to search a given key.

## Javascript



Output:

Yes

Time Complexity: O(n), where n represents the length of the given linked list.
Auxiliary Space: O(1), no extra space is required, so it is a constant.

Recursive Solution:

1) If head is NULL, return false.
2) If head's key is same as x, return true;
3) Else return search(head->next, x)

Following is the recursive implementation of the above algorithm to search a given key.

## Javascript



Output:

Yes

Time Complexity: O(n), where n represents the length of the given linked list.
Auxiliary Space: O(n), for recursive stack where n represents the length of the given linked list.

Please refer complete article on Search an element in a Linked List (Iterative and Recursive) for more details!

Previous Article
Next Article
Article Tags :
Practice Tags :