Algorithm: Step 1: Create nodes first, last; next, prev and cur then set the value as NULL. Step 2: Read the list operation type. Step 3: If operation type is create then process the following steps. 1. Allocate memory for node cur. 2. Read data in cur's data area. 3. Assign cur node as NULL. … Continue reading Array Implementation of list ADT
data structures
ARRAY IMPLEMENTATION OF STACK ADT
Algorithm: STEP 1: Define an array to store the element. STEP 2: Get the users’ choice. STEP 3: If the option is 1 perform creation operation and goto step4. If the option is 2 perform insertion operation and goto step5. If the option is 3 perform deletion operation and goto step6. If the option is … Continue reading ARRAY IMPLEMENTATION OF STACK ADT
Laksh Think 