Rewrite the stack Push algorithm presented in this chapter (see textbook page 133) assuming that top was initialized to 0 instead of 1.

1. if(top==size -1)

2. return false // **overflow error**

3. else

4. {top =top + 1;

5. data[top] = newNode.deepCopy();

6. return true; // push operation successful

7. }