如何在递归中统计卫士语句出现的次数？

def countGuardStatements(root, count):
    if root is None:
        return count

    if isGuardStatement(root):  # 判断当前节点是否为卫士语句
        count += 1

    count = countGuardStatements(root.left, count)  # 递归处理左子树
    count = countGuardStatements(root.right, count)  # 递归处理右子树

    return count

def isGuardStatement(node):
    # 判断节点是否为卫士语句的逻辑，根据实际情况实现

    return False  # 返回判断结果

# 示例调用
root = buildBinaryTree()  # 构建二叉树，具体实现根据实际情况
count = 0
result = countGuardStatements(root, count)
print("卫士语句出现的次数：", result)