Saved Bookmarks
| 1. |
Write an algorithm to implement push operation. |
|
Answer» 1. Start 2. Initialize top with -1. 3. Input the new element. 4. Increment top by one. 5. stack[top]=new element 6. Print “Item Inserted” 7. Stop |
|