Python implements a method for solving all the subitems of the current data

assume that the data structure looks like this:
there are multiple pieces of data, each with an attribute parent (pointing to its own unique identifier id of the parent id), to which it belongs). 

class data
    parent
    id

when I take out one of the pieces of data, I calculate all the subordinate data in one way. Just like the data of China"s administrative region, when I get it in Guangdong Province, I will get it at the city and county level below, and if there are any grades below the county level, I will also get it at the same time.

I wrote some code, which is so ugly that it seems to use recursion. Do you have any good ideas?

Algorithm python
Apr.05,2021

if the storage space is large enough, you can set up a dictionary
if your data is a list named CN (all provinces, cities and counties in China) 

parent_d = {}
for item in CN:
    parent = item['parent']
    if parent in parent_d:
        parent_d[parent].append(item['id'])
    else:
        parent_d[parent] = [item['id']]

then traverse 

def get_all_children(city_id, parent_d):
    if city_id not in parent_d or not city_id:
        return []
    result = []
    temp_parent = [city_id]
    while temp:
        cur_id = temp_parent.pop(-1)
        result += parent_d[cur_id]
        temp_parent = parent_d[cur_id] + temp_parent
    return result

post all the examples

this problem can be converted into N-tree traversal, calculating all the children of a node. 

    def return_all_children(self):
        """
        
        :return:
        """
        root = self
        if not root:
            return []
        que = []  -sharp 
        res = []  -sharp 
        que.append(root)  -sharp
        while len(que):  -sharp 
            length = len(que)
            sub = []  -sharp 
            for i in range(length):
                current = que.pop(0)  -sharp 
                print(current)
                sub.append(current)
                for child in current.return_children:  -sharp 
                    que.append(child)
            res.append(sub)  -sharp 
        return res

Previous: On the entry into force of background-repeat

Next: How does java purge existing content before each write without closing the stream?

css mysql arrays josn react html typescript webpack npm sass R objective-c .net sql-server jquery python-3.x angularjs django angular excel regex iphone ajax linux xml pandas vba spring database wordpress string wpf xcode windows bash postgresql oracle multithreading eclipse list firebase algorithm macos forms image scala visual-studio azure bootstrap spring-boot react-native python-2.7 docker performance function winforms matlab powershell apache dataframe api sqlite numpy rest shell selenium flutter dart maven loops qt swing android-studio csv express file class tensorflow sorting codeigniter perl
MySQL Query : SELECT * FROM `codeshelper`.`v9_news` WHERE status=99 AND catid='6' ORDER BY rand() LIMIT 5
MySQL Error : Disk full (/tmp/#sql-temptable-64f5-1eace23-2115.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
MySQL Errno : 1021
Message : Disk full (/tmp/#sql-temptable-64f5-1eace23-2115.MAI); waiting for someone to free some space... (errno: 28 "No space left on device")
Need Help?