在实体中使用string.split遍历树深度

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

def build_tree(node_list):
    root = TreeNode(node_list[0])
    stack = [(root, 0)]
    
    for i in range(1, len(node_list)):
        node_value = node_list[i]
        depth = node_value.count('.') + 1
        node = TreeNode(node_value)
        
        while stack[-1][1] >= depth:
            stack.pop()
        
        parent = stack[-1][0]
        parent.children.append(node)
        stack.append((node, depth))
    
    return root

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

# 示例输入字符串
input_string = 'A,A.1,A.2,A.2.1,A.2.2,A.3,A.3.1,A.3.2,A.3.2.1,A.3.2.2,A.3.3'

# 使用逗号分隔字符串，构建树
node_list = input_string.split(',')
root = build_tree(node_list)

# 遍历树的深度并打印节点值
traverse_depth(root)