2-R 무엇이 잘못되었을까요?

예제는 다 통과하는데 제출하면 틀렸다고 나오네요..

bfs를 통해 풀었는데 뭐가 문제인지 잘 모르겠습니다.

/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <iostream>
#include <vector>
#include <queue>

std::vector<int> tree[50];

void bfs(const int start, const int removeNumber)
{
    bool visited[50] = {false, };
    std::queue<int> que;
    que.push(start);
    visited[start] = true;
    
    int curr = 0;
    int count = 0;
    while(que.empty() == false)
    {
        curr = que.front();
        que.pop();
        for (int i = 0; i < tree[curr].size(); ++i)
        {
            if (!visited[tree[curr][i]] && tree[curr][i] != removeNumber)
            {
                if (tree[tree[curr][i]].size() == 0)
                {
                    count += 1;
                    continue;
                }
                que.push(tree[curr][i]);
                visited[tree[curr][i]] = true;
            }    
        }
        
    }
    
    std::cout << count << "\n";
    
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    
    int N, temp, removeNumber;
    
    std::cin >> N;
    
    for(int i = 0; i < N; ++i)
    {
        std::cin >> temp;
        if (temp == -1)
        {
            continue;
        }
        
        tree[temp].push_back(i);
    }
    
    std::cin >> removeNumber;
    if (removeNumber == 0)
    {
        std::cout << 0 << "\n";
        return 0;
    }

    bfs(0, removeNumber);

    return 0;
}

    if (removeNumber == 0)

#include <iostream>
#include <vector>
#include <queue>

std::vector<int> tree[50];

void bfs(const int start, const int removeNumber)
{
    bool visited[50] = {false, };
    std::queue<int> que;
    que.push(start);
    visited[start] = true;

    int curr = 0;
    int count = 0;
    while(!que.empty())
    {
        curr = que.front();
        que.pop();
        bool isLeaf = true;
        for (int i = 0; i < tree[curr].size(); ++i)
        {
            if (tree[curr][i] != removeNumber && !visited[tree[curr][i]])
            {
                isLeaf = false;
                que.push(tree[curr][i]);
                visited[tree[curr][i]] = true;
            }
        }
        if (isLeaf)
        {
            count += 1;
        }
    }

    std::cout << count << "\n";
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);

    int N, temp, removeNumber, root = -1;

    std::cin >> N;

    for(int i = 0; i < N; ++i)
    {
        std::cin >> temp;
        if (temp == -1)
        {
            root = i;
        }
        else
        {
            tree[temp].push_back(i);
        }
    }

    std::cin >> removeNumber;

    if (removeNumber == root)
    {
        std::cout << 0 << "\n";
        return 0;
    }

    bfs(root, removeNumber);

    return 0;
}