Stack simple question

[Blessman11]

Are stacks deleted when they are removed from the top? I'm just wondering

[Blessman11]

oh its ok, I just found out. The reason is in this code, apparently its true

// Read words and print them in reverse order.
//   Variation using stack and string.
// Fred Swartz 2001-11-08, 2001-12-04

#include <iostream>
#include <stack>
#include <string>
using namespace std;

int main() {

    stack<string> allwords; // stack of all words
    string word;            // input buffer for words.

    // read words/tokens from input stream
	int u = 0;
    while (u < 5) {
		cin >> word;
        allwords.push(word);
		u++;
    }
    
    cout << "Number of words = " << allwords.size() << endl;

    // write out all the words in reverse order.
    while (!allwords.empty()) {
       cout << allwords.top() << endl;
       allwords.pop();            // remove top element
    }
	cin.get();
    return 0;
}//end main