获取给定位置的同一级别的所有可能节点

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

def get_same_level_nodes(root, target):
    if not root:
        return []

    queue = [root]
    level = 0
    while queue:
        level_size = len(queue)
        for _ in range(level_size):
            node = queue.pop(0)
            if node.val == target:
                return [child.val for child in queue]
            queue.extend(node.children)
        level += 1

    return []

# 示例用法
# 创建一个树结构
root = TreeNode(1)
root.children = [TreeNode(2), TreeNode(3), TreeNode(4)]
root.children[0].children = [TreeNode(5), TreeNode(6)]
root.children[1].children = [TreeNode(7)]

# 获取节点2所在层级的所有可能节点
result = get_same_level_nodes(root, 2)
print(result)  # 输出：[3, 4]

# 获取节点7所在层级的所有可能节点
result = get_same_level_nodes(root, 7)
print(result)  # 输出：[]