Saved Bookmarks
| 1. |
Identify and correct mistake in the following Stack – PUSH algorithm, start if stack is full return null endif top = top -1 stack[top] = data stop |
|
Answer» top = top – 1 is to be replaced by top = top + 1 |
|