{"id":26917,"date":"2017-12-26T21:15:23","date_gmt":"2017-12-26T15:45:23","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26917"},"modified":"2017-12-26T21:15:23","modified_gmt":"2017-12-26T15:45:23","slug":"java-algorithm-search-element-linked-list-iterative-recursive","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-algorithm-search-element-linked-list-iterative-recursive\/","title":{"rendered":"Java Algorithm – Search an element in a Linked List both Iterative and Recursive"},"content":{"rendered":"

Write a C function that searches a given key \u2018x\u2019 in a given singly linked list. The function should return true if x is present in linked list and false otherwise.<\/span><\/p>\n

   bool search(Node *head, int x)<\/pre>\n
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.<\/p>\n
Iterative Solution<\/strong><\/p>\n
2) Initialize a node pointer, current = head.\r\n3) Do following while current is not NULL\r\n    a) current->key is equal to the key being searched return true.\r\n    b) current = current->next\r\n4) Return false<\/pre>\n
Java Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ Iterative Java program to search an element\/\/ in linked list \/\/Node classclass Node{    int data;    Node next;    Node(int d)    {        data = d;        next = null;    }} \/\/Linked list classclass LinkedList{    Node head;  \/\/Head of list     \/\/Inserts a new node at the front of the list    public void push(int new_data)    {        \/\/Allocate new node and putting data        Node new_node = new Node(new_data);         \/\/Make next of new node as head        new_node.next = head;         \/\/Move the head to point to new Node        head = new_node;    }     \/\/Checks whether the value x is present in linked list    public boolean search(Node head, int x)    {        Node current = head;    \/\/Initialize current        while (current != null)        {            if (current.data == x)                return true;    \/\/data found            current = current.next;        }        return false;   \/\/data not found    }     \/\/Driver function to test the above functions    public static void main(String args[])    {         \/\/Start with the empty list        LinkedList llist = new LinkedList();         \/*Use push() to construct below list        14->21->11->30->10  *\/        llist.push(10);        llist.push(30);        llist.push(11);        llist.push(21);        llist.push(14);         if (llist.search(llist.head, 21))            System.out.println("Yes");        else            System.out.println("No");    }}\/\/ This code is contributed by Pratik Agarwal<\/code><\/pre> <\/div>\n[ad type=”banner”]\n
Output:<\/strong><\/p>\n
Yes<\/pre>\n
Recursive Solution<\/strong><\/p>\n
bool search(head, x)<\/strong>\r\n1) If head is NULL, return false.\r\n2) If head's key is same as x, return true;\r\n2) Else return search(head->next, x)<\/pre>\n
Java Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ Recursive Java program to search an element\/\/ in linked list  \/\/ Node classclass Node{    int data;    Node next;    Node(int d)    {        data = d;        next = null;    }} \/\/ Linked list classclass LinkedList{    Node head;  \/\/Head of list     \/\/Inserts a new node at the front of the list    public void push(int new_data)    {        \/\/Allocate new node and putting data        Node new_node = new Node(new_data);         \/\/Make next of new node as head        new_node.next = head;         \/\/Move the head to point to new Node        head = new_node;    }     \/\/ Checks whether the value x is present    \/\/ in linked list    public boolean search(Node head, int x)    {        \/\/ Base case        if (head == null)            return false;         \/\/ If key is present in current node,        \/\/ return true        if (head.data == x)            return true;         \/\/ Recur for remaining list        return search(head.next, x);    }     \/\/ Driver function to test the above functions    public static void main(String args[])    {        \/\/ Start with the empty list        LinkedList llist = new LinkedList();         \/* Use push() to construct below list           14->21->11->30->10  *\/        llist.push(10);        llist.push(30);        llist.push(11);        llist.push(21);        llist.push(14);         if (llist.search(llist.head, 21))            System.out.println("Yes");        else            System.out.println("No");    }}\/\/ This code is contributed by Pratik Agarwal<\/code><\/pre> <\/div>\n[ad type=”banner”]\n
Output:<\/strong><\/p>\n
Yes<\/pre>\n","protected":false},"excerpt":{"rendered":"
Java Algorithm – Search an element in a Linked List both Iterative and Recursive –  Linked List – Write a C function that searches a given key \u2018x\u2019 in a given<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,2139,79476,79478],"tags":[80299,80286,80289,80291,80290,80292,80298,80296,80294,80300,80293,80295,80297,80288,80287,80285],"class_list":["post-26917","post","type-post","status-publish","format-standard","hentry","category-coding","category-java","category-linked-list","category-singly-linked-list","tag-algorithm-to-reverse-a-linked-list-in-data-structure","tag-algorithm-to-search-an-element-in-singly-linked-list","tag-binary-search-using-linked-list","tag-find-the-length-of-the-linked-list-using-recursion","tag-linked-list-recursion-c","tag-linked-list-recursion-java","tag-reverse-a-linked-list-algorithm","tag-reverse-a-linked-list-c","tag-reverse-a-linked-list-java","tag-reverse-a-linked-list-recursively-c","tag-reverse-a-linked-list-using-recursion-in-c","tag-reverse-a-singly-linked-list","tag-reverse-linked-list-recursive-java","tag-search-an-element-in-doubly-linked-list","tag-search-linked-list-complexity","tag-searching-in-linked-list-algorithm"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26917","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26917"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26917\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26917"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26917"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26917"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}