Stack Pop Operation
Algorithm INPUT: TOP POINTER WHICH IS USED TO POINT TO THE TOP OF THE STACK OUTPUT: STACK AFTER POP OPERATIONDATA STRUCTURE: STACK USING ARRAY Code Output
Stack Pop Operation Read More »
DSA
Stack Push Operation
Algorithm INPUT: TOP POINTER WHICH IS USED TO POINT TO THE TOP OF THE STACK AND THE ELEMENT TO BE PUSHOUTPUT: STACK AFTER PUSH OPERATIONDATA STRUCTURE: STACK USING ARRAY Code Output
Stack Push Operation Read More »
Circularly LinkedList Deletion at any position
Algorithm INPUT: HEADER IS A POINTER TO THE HEADER NODE OF THE LINKEDLIST AND X IS THE POSITION OF THE ELEMENT TO BE DELETEDOUTPUT: LINKEDLIST WITHOUT THE ELEMENT AT X TH POSITIONDATA STRUCTURE: SINGLY LINKEDLIST Code Output Learn How to Delete a Element at the beginning in a Linkedlist.
Circularly LinkedList Deletion at any position Read More »
Circularly LinkedList Deletion at the End
Algorithm INPUT: HEADER IS A POINTER TO THE HEADER NODE OF THE LINKEDLISTOUTPUT: LINKEDLIST WITHOUT FIRST ELEMENTDATA STRUCTURE: SINGLY LINKEDLIST Code Output
Circularly LinkedList Deletion at the End Read More »
Circularly LinkedList Deletion at Beginning
Algorithm INPUT: HEADER IS A POINTER TO THE HEADER NODE OF THE LINKEDLISTOUTPUT: LINKEDLIST WITHOUT FIRST ELEMENTDATA STRUCTURE: SINGLY LINKEDLIST Code Output Learn How to Delete a Element at the any position in a Linkedlist.
Circularly LinkedList Deletion at Beginning Read More »