Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is a perfect Square.
Only the weights of nodes 1, 4 and 5 are perfect squares.
Approach: Perform dfs on the tree and for every node, check if it’s weight is a perfect square or not.
Below is the implementation of the above approach:
- Count the nodes in the given tree whose weight is even
- Count the nodes in the given tree whose weight is even parity
- Count the nodes in the given tree whose weight is a power of two
- Count the nodes in the given tree whose sum of digits of weight is odd
- Count the nodes in the given tree whose weight is prime
- Count number of paths whose weight is exactly X and has at-least one edge of weight M
- Largest perfect square number in an Array
- Largest factor of a given number which is a perfect square
- Largest Divisor of a Number not divisible by a perfect square
- Find sum of all nodes of the given perfect binary tree
- Queries to find the maximum Xor value between X and the nodes of a given level of a perfect binary tree
- Count nodes within K-distance from all nodes in a set
- Permutation of numbers such that sum of two consecutive numbers is a perfect square
- Count BST nodes that lie in a given range
- Count the nodes whose sum with X is a Fibonacci number
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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.