Dictionary Data Structure

Dictionary Data Structure

1. The dictionaries are also known as associative arrays or maps.

   • void Add(K key, V value), V Get(K key), bool Remove(key), bool Contains(key), int Count

2. Every element in the dictionary has a key and an associated value for this key. Both the key and the value represent a pair.

   • For every key in the dictionary, there is a corresponding value. One key can hold only one value. The aggregation of all the pairs (key, value) represents the dictionary.

3. As well as the data (values), that the dictionary holds, there is also a key that is used for searching and finding the required values. The elements of the dictionary are represented by pairs (key, value), where the key is used for searching.

   • The idea of the dictionaries is to provide us with more flexibility regarding the set of the keys.