new Stack(new int[] { 1, 2, 3, 4, 5, 6 })

   

using System;
using System.Collections;

public class Starter {
    public static void Main() {
        Stack numbers = new Stack(new int[] { 1, 2, 3, 4, 5, 6 });
        int total = numbers.Count;
        for (int count = 0; count < total; ++count) {
            Console.WriteLine(numbers.Pop());
        }
    }
}

Related examples in the same category

1.	new Stack())
2.	Implements the stack data type using an array
3.	Stack demo
4.	Stack to array
5.	illustrates the use of a Stack
6.	A stack class for characters
7.	Demonstrate the Stack class
8.	Stack(T) Class represents a variable size last-in-first-out (LIFO) collection of instances of the same arbitrary type.
9.	Overflow Stack
10.	Thread Safe Stack
11.	A Stacked array is an integer array that contains a sequence of ascending integers.
12.	FixedSizeStack provides an easy Stack implementation width a fixed size to prevent Stack Overflows in another sense.
13.	Stack abstraction that also supports the IList interface

new Stack(new int[] { 1, 2, 3, 4, 5, 6 }) : Stack « Collections Data Structure « C# / C Sharp

Related examples in the same category