这可以用Pandas来实现。使用import pandas as pd导入pandas
并将dataframe转换为dictionary
dictionary = dataframe.to_dict()

管理它。需要添加一个级别列和一个值
如果我根据层（0，1，2）添加一个级别列
df.columns=[“parent_id”，“child_id”，“level”]
st.write（hs_input_output_hs_df）def recurse（parent_id，level）：# create the base result result = {“name”：parent_id} #，“level”：int（level）

# get all of the children of this parent, one level below this one
children = df[(df.parent_id == parent_id) & (df["level"] == level + 1)]

# if there are no such children, then return without a _children key
if children.empty:
    result["value"]=1
    return result

# otherwise, recurse on each child_id
result["children"] = [recurse(child_id, level + 1) for child_id in sorted(children.child_id.unique())]

return result

tree = [recurse（parent_id，0）for parent_id in sorted（df[df[“level”] == 1].parent_id.unique（））]
st.write（tree[0]）