[ad_1]
\n<\/p>\n
The trick is to find out in advance whether a target_key<\/em> is among the next children (= Thus, the code looks as follows:<\/p>\n This is almost<\/em> a copy of the spin-off How can I replace a key:value pair by its value wherever the chosen key occurs in a deeply nested dictionary?<\/em>. But it took me a while to change that answer so that it would delete a key:value by its key. That is why I am sharing this, please mind that 95% of the credits go to the link!<\/p>\n The main added value over the “spun-off answer” is that you search for the If you want to print or save the dictionary nicely, see How do I write JSON data to a file?.<\/p>\n<\/p><\/div>\nthis_dict[key]<\/code> = the values of the current dict iteration) before<\/em> you reach the child level recursively. Only then you can still delete a key:value pair of the child level while iterating over a dictionary. Once you have reached the same level as the key to be deleted and then try to delete it from there, you get the error:<\/p>\nRuntimeError: dictionary changed size during iteration\n<\/code><\/pre>\nCode<\/h4>\n
import copy\n\ndef find_remove(this_dict, target_key, bln_overwrite_dict=False):\n if not bln_overwrite_dict:\n this_dict = copy.deepcopy(this_dict)\n\n for key in this_dict:\n # if the current value is a dict, dive into it\n if isinstance(this_dict[key], dict):\n if target_key in this_dict[key]:\n this_dict[key].pop(target_key)\n\n this_dict[key] = find_remove(this_dict[key], target_key)\n\n return this_dict\n\ndict_nested_new = find_remove(nested_dict, \"sub_key2a\")\n<\/code><\/pre>\nCredits<\/h4>\n
target_key<\/code> in the values<\/em> in advance of entering the next recursion level by checking if target_key in this_dict[key]:<\/code>.<\/p>\n
\nSide note: Formatting the output<\/em><\/h4>\n