LINKED LIST

Declaration Node

C++ Python
struct listNode{ class listNode:
Int data; def__init__(self, value):
Struct listNode * next; Self.data=value;
Self.next = None;
};
struct listNode *head;
head = listNode(20);
C++ Python
void createnode(){ // createnode
head = NULL;
} newnode =listNode(item)
void insertion(int item){ newnode.next = head;
struct listNode *newnode;
newnode = new listNode;
head = newnode;
newnode.data=item; // insertion
newnode.next=NULL; def insertion( self, item ):
if (head==NULL)
newNode = listNode( item )
head = newnode;
newNode.next = self._head
else{ self._head = newNode
newnode.next = head;
head = newnode;}
}
C++ Python
void deletion(int item){ def deletion (self, item):
struct listNode *tempPtr, *currPtr, *prevPtr; prevPtr = None
if (head==NULL
cout<<“empty list”; currPtr = head
else{ while (currPtr is not None and currPtr.data !=
currPtr = head;
item) :
prevPtr= NULL;
while (currPtr!=NULL && item I= currPtr->data){ prevPtrNode = currPtrNode
prevPtr=currPtr;
currPtr = currPtr->next;} currPtrNode = curNode.next
if(prev==NULL){
tempPtr = currPtr; if currPtr is not None :
head=currptr->next;
if currPtr is head :
delete tempPtr;}
else{ head = currPtr.next
temptPtr=currPtr;
prevPtr->next = currPtr->next;
else :
delete tempPtr; prevPtr.next = currPtr.next
}
}
}
C++
void traversal(){
struct listNode *currPtr;
currPtr= head;
while (currptr!=NULL){
cout<<currPtr->data;
currPtr = currPtr->next;}
}
Python
def traversal(head):
currPtr = head
while currPtr is not None :
print currPtr.data
currPtr = currPtr.next
 C++ Python
bool search(int item){ def Search( head, target ):
struct listNode *currPtr; currPtr = head
currPtr = head; while currPtr is not None and currPtr.data != target :
while(currPtr!=NULL && currPtr-data != item){ currPtr= currPtr.next
currPtr = currPtr->next; return currPtr is not Non
}
if (currPtr!=NULL)
return true;
else
return false;
}