Saved Bookmarks
| 1. |
If the size of a STACK is “n” then the time complexity for pushing an item onto stack would be |
|
Answer» Explanation: |
|