What is the name of the dictionary decomposition algorithm?

Question

Python

There is a dictionary

{
"a":"1", 
"b":{
      "c":{"d":"2",
             "e":"3",
            }
      "f":"4",
      }
"g":"5"
}

Need to turn it into this

{
"a":"1",
"b.c.d":"2",
"b.c.e":"3",
"b.f":"4",
"g":"5",
}

I understand that this is done recursively, checking instances, etc., but I can’t figure out how to solve this problem in my head, you can tell me the name of the algorithm for solving this problem, so that I can remember it or understand in which direction I need to move.

Answer 1

Not called at all. Traverse recursively nested elements, and that's it:

def nested_to_plain(obj):
  result = {}

  for key, val in obj.items():
    if type(val) == dict:
      result.update({ key + '.' + k: v for k, v in nested_to_plain(val).items() })
    else:
      result[key] = val

  return result