Reverse Array Using Stack
Description To reverse the elements of stack first insert all elements of array into stack. Now pop the elements of stack one by one and store into array. As stack…
All Program Related To Data Structure
Linked List Representation Of Stack
Description Linked List representation of stack is difficult to implement but there is no need to declare the size before. Addition and deletion of node from stack can be done…
Array Representation Of Stack
Description The array implementation of stack means all the operations of stack will be performed using array. Here all the operation means push, pop, peek. 1) PUSH : Push operation…
What is Stack
Stack is a data structure used for storing data in particular order.It follow the Last In First Out(LIFO) pattern for storing the data.LIFO means the data will be deleted first…
Program For Finding Second Smallest Element Of Array
Description To find second smallest element, first find the smallest element. To find smallest element, first declare a largest element. min = Integer.MAX_VALUE Compare each element with this. If element…
Program To Delete A Node From beginning Circular Singly Linked List
Description To delete a node in the beginning of circular linked list - Case 1: Check if list is empty Show message that list is empty. Case 2: If List…
Program To Add A Node At The End Circular Singly Linked List
Description To add a node in the end of circular linked list - Case 1: Check if list is empty a) Assign the address of new node to head b)…
Program To Add A Node At The Beginning Of Circular Linked List
Description To add a node in the beginning of circular linked list - Case 1: Check if list is empty a) Assign the address of new node to head b)…
Program To Create And Display Circular Singly Linked List
Description 1. In a circular linked list, the last node contains the address of the first node of the list. 2. Circular linked list can be implemented in both singly…
Quick Sort
Description -> Based on divide and conquer strategy. -> This is in-place sorting algorithm. Steps for Quick Sort 1) Select any element from array as pivot. 2) Rearrange array element…
- 1
- 2
- 3
- 4
- …
- 9
- Go to the next page