C# 4 and .NET 4

linked list ❘ 241
{
Console.Write(item);
}
Console.WriteLine();
code snippet StackSample/Program.cs
Because the items are read in order from the last added to the first, the following result is produced:
CBA
Reading the items with the enumerator does not change the state of the items. With the Pop() method,
every item that is read is also removed from the stack. This way you can iterate the collection using a while
loop and verify the Count property if items still exist:
var alphabet = new Stack();
alphabet.Push('A');
alphabet.Push('B');
alphabet.Push('C');
Console.Write("First iteration: ");
foreach (char item in alphabet)
{
Console.Write(item);
}
Console.WriteLine();
Console.Write("Second iteration: ");
while (alphabet.Count > 0)
{
Console.Write(alphabet.Pop());
}
Console.WriteLine();
The result gives CBA twice, once for each iteration. After the second iteration, the stack is empty because
the second iteration used the Pop() method:
First iteration: CBA
Second iteration: CBA
tinKed lisT
LinkedList is a doubly linked list, where one element references the next and the previous one, as
shown in Figure 10-3.
Value
Value
Value
Value
Next
Next
Next
Next
Previous
Previous
Previous
Previous
figure 10-3
www.it-ebooks.info