Given a n-ary tree, count number of nodes which have more number of children than parents

Given a N-ary tree represented as adjacency list, we need to write a program to count all such nodes in this tree which has more number of children than its parent.

For Example,

In the above tree, the count will be 1 as there is only one such node which is ‘2’ which has more number of children than its parent. 2 has three children (4, 5 and 6) whereas its parent, 1 has only two children (2 and 3).

We can solve this problem using both BFS and DFS algorithms. We will explain here in details about how to solve this problem using BFS algorithm.
As the tree is represented using adjacency list representation. So, for any node say ‘u’ the number of children of this node can be given as adj[u].size().
Now the idea is to apply BFS on the given tree and while traversing the children of a node ‘u’ say ‘v’ we will simply check is adj[v].size() > adj[u].size().

Below is the C++ implementation of above idea:





// C++ program to count number of nodes
// which has more children than its parent
using namespace std;
// function to count number of nodes
// which has more children than its parent
int countNodes(vector<int> adj[], int root)
    int count = 0;
    // queue for applying BFS
    queue<int> q;
    // BFS algorithm
    while (!q.empty())
        int node = q.front();
        // traverse children of node
        for( int i=0;i<adj[node].size();i++)
            // children of node
            int children = adj[node][i];
            // if number of childs of children
            // is greater than number of childs
            // of node, then increment count
            if (adj[children].size() > adj[node].size())
    return count;
// Driver program to test above functions
int main()
    // adjacency list for n-ary tree
    vector<int> adj[10];
    // construct n ary tree as shown
    // in above diagram
    int root = 1;
    cout << countNodes(adj, root);
    return 0;




Time Complexity: O( n ) , where n is the number of nodes in the tree.

This article is contributed by Harsh Agarwal. If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

My Personal Notes arrow_drop_up

Improved By : Akanksha_Rai

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.