基于队列的非二叉树的BFS /层次顺序遍历

from collections import deque

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

def bfs_traversal(root):
    if not root:
        return []
    
    queue = deque([root])
    result = []
    
    while queue:
        current_node = queue.popleft()
        result.append(current_node.value)
        
        for child in current_node.children:
            queue.append(child)
    
    return result

# 示例树结构
root = TreeNode('A')
node_b = TreeNode('B')
node_c = TreeNode('C')
node_d = TreeNode('D')
node_e = TreeNode('E')
node_f = TreeNode('F')

root.children = [node_b, node_c]
node_b.children = [node_d, node_e]
node_c.children = [node_f]

print(bfs_traversal(root))  # 输出: ['A', 'B', 'C', 'D', 'E', 'F']