Count number of nodes having more number of children than parents in n-ary tree

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.

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.

Count number of nodes having more number of children than parents in n-ary tree : https://www.geeksforgeeks.org/given-n-ary-tree-count-number-nodes-number-children-parent/