从字符串列表中构造一个树

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.children = []

root = TreeNode(lst[0])

for string in lst[1:]:
    # 处理当前字符串的逻辑

current_node = root
for char in string:
    # 在当前节点的子节点列表中查找是否存在值为char的节点
    child_node = None
    for child in current_node.children:
        if child.value == char:
            child_node = child
            break
    # 如果不存在，则创建一个新的节点，并将其添加到当前节点的子节点列表中
    if child_node is None:
        child_node = TreeNode(char)
        current_node.children.append(child_node)
    # 更新当前节点为找到的子节点，继续处理下一个字符
    current_node = child_node

def print_tree(node, indent=0):
    print(' ' * indent + node.value)
    for child in node.children:
        print_tree(child, indent + 1)

print_tree(root)