$//$ singly$\_$linked$\_$list.cpp : Defines the entry point for the console application.

$//$

#include "stdafx.h$"$

#include

#include

using namespace std;

struct Node

$\{$

int data;

string x;

Node$*$ next; $//$it will contain pointer to the next node in the list.

$\}$;

class LinkedList

$\{$

private:

Node$*$ head; $//$pointing to the first node in the list

public:

LinkedList$()$

$\{$

head$=$nullptr;

$\}$

void insert$($int data, string b$)$

$\{$

Node$*$ new$\_$node $=$ new Node$()$;

new$\_$node$->$data $=$ data;

new$\_$node$->$x $=$ b;

new$\_$node$->$next $=$ nullptr;

if$($head$==$nullptr$)$

$\{$

head $=$ new$\_$node;

$\}$

else

$\{$

Node$*$ temp $=$ head;

while$($temp$->$next!$=$nullptr$)$

$\{$

temp $=$ temp$->$next;

$\}$

temp$->$next $=$ new$\_$node; $//$this points to last current node in list

$\}$

$\}$

void display$()$

$\{$

Node$*$ temp $=$ head;

while$($temp$!=$nullptr$)$

$\{$

coutdata$==$value$)$

$\{$

head $=$ temp$->$next;

delete temp; $//$to free the memory

$\}$

while$($temp$!=$nullptr && temp$->$data!$=$value$)$

$\{$

prev $=$ temp;

temp $=$ temp$->$next;

$\}$

if$($temp$==$nullptr$)//$if list is empty

$\{$

cout$<<$"Item is not in the list";

return;

$\}$

prev$->$next $=$ temp$->$next;

delete temp;

$\}$

$\}$;

int main$()\{$

LinkedList l;

l$.$insert$(10,$ "Ahmed"$)$;

l$.$insert$(20,$ "Habib"$)$;

l$.$insert$(30,$ "Ali"$)$;

l$.$insert$(40,$ "Moeen"$)$;

l$.$insert$(50,$ "sohaib"$)$;

l$.$insert$(60,$ "Abdul Rafeh"$)$;

cout$<<$"Below is the inserted list of Items : $"$;

l$.$display$()$;

cout$<$

You have to implement the search data and update data function in the sample singly linked list source code.$$

$2.$ Implement the complete doubly linked list, implement the insert node, delete node, update node data, search data, display data from doubly linked list.$$