Given a n-ary tree and a number x, find and return the number of nodes which are greater than x.
In the given tree, x = 7 Number of nodes greater than x are 4.
The idea is maintain a count variable initialize to 0. Traverse the tree and compare root data with x. If root data is greater than x, increment the count variable and recursively call for all its children.
Below is the implementation of idea.
Number of nodes greater than 5 are 2
This article is contributed by Chhavi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.
- Next Larger element in n-ary tree
- Number of Binary Trees for given Preorder Sequence length
- Second Largest element in n-ary tree
- Sub-tree with minimum color difference in a 2-coloured tree
- Check if the given array can represent Level Order Traversal of Binary Search Tree
- HashSet vs TreeSet in Java
- Preorder from Inorder and Postorder traversals
- Count pairs in a binary tree whose sum is equal to a given value x
- Find the maximum node at a given level in a binary tree
- Print nodes in top view of Binary Tree | Set 2