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.
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 implementation of above idea:
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 contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Count of nodes in a Binary Tree whose immediate children are co-prime
- Count nodes with two children at level L in a Binary Tree
- Count of nodes in a Binary tree with immediate children as its factors
- Count the number of nodes at given level in a tree using BFS.
- Count the number of visible nodes in Binary Tree
- Count nodes in the given tree whose weight is a fibonacci number
- Count the nodes in the given Tree whose weight is a Perfect Number
- Count the nodes in the given tree whose weight is a powerful number
- Number of children of given node in n-ary Tree
- General Tree (Each node can have arbitrary number of children) Level Order Traversal
- Count of Nodes whose both immediate children are its prime factors
- Count the nodes of the tree which make a pangram when concatenated with the sub-tree nodes
- Number of nodes greater than a given value in n-ary tree
- Number of special nodes in an n-ary tree
- Level with maximum number of nodes using DFS in a N-ary tree