Is it possible to create a dictionary with an ordered set of keys in Python?

Yes, it is possible. Starting from Python 3.7, standard dictionaries preserve insertion order of keys. For a more explicit indication of order and in versions before 3.7, collections.OrderedDict was used.

# In a standard dictionary (Python 3.7+), order is preserved
my_dict = {"apple": 1, "banana": 2, "orange": 3}
# When iterating over keys, items, or key-value pairs
# the order will match the insertion order
for key in my_dict:
    print(key) # Will output: apple, banana, orange

# Using collections.OrderedDict (compatible with older versions and explicitly indicates ordering)
from collections import OrderedDict

ordered_dict = OrderedDict([('apple', 1), ('banana', 2), ('orange', 3)])
for key in ordered_dict:
    print(key) # Will output: apple, banana, orange

The main difference between OrderedDict and the standard dictionary in Python 3.7+ is in behavior when equality is checked. OrderedDict considers dictionaries equal only if they have the same order of elements, whereas the standard dictionary ignores order during comparison.

# Comparing standard dictionaries (Python 3.7+) - order does not matter
dict1 = {"apple": 1, "banana": 2}
dict2 = {"banana": 2, "apple": 1}
print(dict1 == dict2) # Will output: True

# Comparing OrderedDict - order matters
from collections import OrderedDict
odict1 = OrderedDict([('apple', 1), ('banana', 2)])
odict2 = OrderedDict([('banana', 2), ('apple', 1)])
print(odict1 == odict2) # Will output: False