Queue(T) OverviewUsing the Queue(T) ClassCreating a QueueQueue(T)()Queue(T)(IEnumerable(T))Queue(T)(int size)Adding Items to the Queuevoid Enqueue(T item)Removing Items from the Queuevoid Clear()T Dequeue()Checking the QueueT Peek()bool Contains(T item)int CountCleaning the Queuevoid TrimExcess()Stack(T) OverviewUsing the Stack(T) ClassCreating a StackStack(T)()Stack (T)(IEnumerable(T))Stack (T)(int size)Adding Items to the Stackvoid Push(T item)Removing Items from the Stackvoid Clear()T Pop()Checking the StackT Peek()bool Contains(T item)int CountCleaning the StackTrimExcessDictionary(TKey,TValue) OverviewUnderstanding Dictionary(TKey,TValue) ImplementationUsing the Dictionary(TKey,TValue) ClassCreating a DictionaryDictionary(TKey, TValue)()Dictionary(TKey, TValue)(IDictionary(TKey, TValue) dictionary)Dictionary(TKey, TValue)(IEqualityComparer(TKey) comparer)Dictionary(TKey, TValue)(int capacity)Dictionary(TKey, TValue)(IDictionary(TKey, TValue) dictionary, IEqualityComparer(TKey) comparer)Dictionary(TKey, TValue)(int capacity, IEqualityComparer(TKey) comparer)Adding Items to a Dictionaryvoid Add(TKey key, TValue value)TValue Item[TKey key] { set; }Removing Items from a Dictionaryvoid Clear()bool Remove(TKey key)Retrieving Values from the Dictionary by Using a Keybool TryGetValue(TKey key, out TValue value)TValue Item[TKey key] { get; }Checking the Dictionarybool ContainsKey(TKey key)bool ContainsValue(TValue value)int CountDictionary<TKey,TValue>.KeyCollection KeysDictionary<TKey,TValue>.ValueCollection ValuesBitArray OverviewUsing the BitArray ClassCreating a BitArrayBitArray(BitArray bits)BitArray(Boolean[] values)BitArray(Byte[] bytes)BitArray(Int32 length, Boolean defaultValue)BitArray(Int32 length)BitArray(Int32[] values)Accessing Bits in the BitArray Classvoid Set(int index, bool value)void SetAll(bool value)bool Get(int index)bool Item[int index] {get; set; }Using the BitArray Class for Bit OperationsBitArray And(BitArray value)BitArray Not()BitArray Or(BitArray value)BitArray Xor(BitArray value)CollectionBase and DictionaryBase OverviewUsing CollectionBasevoid OnValidate(object value)void OnClear() and void OnClearComplete()void OnInsert(int index, Object value) and void OnInsertComplete(int index, Object value)void OnRemove(int index, object value) and void OnRemoveComplete(int index, object value)void OnSet(int index, object oldValue, object newValue) and void OnSetComplete(int index, object oldValue, object newValue)Using DictionaryBasevoid OnValidate(object key, object value)void OnClear() and void OnClearComplete()void OnGet()void OnInsert(Object key, Object value) and void OnInsertComplete(Object key, Object value)void OnRemove(Object key, Object value) and void OnRemoveComplete(Object key, Object value)void OnSet(Object key, object oldValue, object newValue) and void OnSetComplete(Object key, object oldValue, object newValue)HashSet(T) OverviewUsing the HashSet(T) ClassCreating a HashSet(T)HashSet(T) ()HashSet(T) (IEnumerable(T))HashSet(T) ( IEqualityComparer(T))HashSet(T) ( IEnumerable(T), IEqualityComparer(T))Adding Items to the HashSet(T)bool Add(T item)Removing Items from a HashSet(T)void Clear()bool Remove(T item)int RemoveWhere(Predicate(T) match)Using a Method with RemoveWhereUsing a Lambda Expression with RemoveWherePerforming Set Operations on a HashSet(T)void IntersectWith(IEnumerable(T) other)bool IsProperSubsetOf(IEnumerable(T) other)bool IsProperSupersetOf(IEnumerable(T) other)bool IsSubsetOf(IEnumerable(T) other)bool IsSupersetOf(IEnumerable(T) other)bool Overlaps(IEnumerable(T) other)void UnionWith(IEnumerable(T) other)void ExceptWith(IEnumerable(T) other)bool Contains(T item)void TrimExcess()Sorted Collections OverviewSortedList(TKey, TValue)SortedDictionary(TKey, TValue)Summary