Comparison of C STL collections and C collections

Question

I'm still learning C#, and I was startled to see that a List<T> behaves much like a std::vector rather than a std::list. Can someone please describe all of the C# collections in terms of the STL (or, if that's too complex, standard conceptual data types with Wikipedia links)? I believe the reference will be of great use to many people.

A short list of collections of interest (feel free to add more) is as follows:

1. Array
2. List
3. ArrayList
4. HashTable
5. Dictionary
6. ListDictionary
7. SortedDictionary
8. SortedList
9. Queue
10. Stack

Answer 1

This is what I know

1. Array - C array, though the .NET Array can have a non-zero starting index.
2. List<T> - std::vector<T>
3. Dictionary<TKey, TValue> - unordered_map<Key, Data>
4. HashSet<T> - unordered_set<Key>
5. SortedDictionary<TKey, TValue> - std::map<Key, Data>
6. SortedList<TKey, TValue> - equivalent to a std::vector<T> but keeping it ordered by using binary search + insert when adding elements.
7. SortedSet<T> - std::set<Key>
8. Queue<T> - std::queue<T>
9. Stack<T> - std::stack<T>
10. LinkedList<T> - std::list<T>