Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is even.
Only the weights of the nodes 2, 4 and 5 are even.
Approach: Perform dfs on the tree and for every node, check if it’s weight is divisible by 2 or not. If yes then increment count.
Below is the implementation of the above approach:
- Count the nodes in the given tree whose weight is prime
- 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 a power of two
- Count the nodes in the given tree whose weight is even parity
- Count the nodes whose weight is a perfect square
- Count number of paths whose weight is exactly X and has at-least one edge of weight M
- Count the number of nodes at a given level in a tree using DFS
- Count Non-Leaf nodes in a Binary Tree
- Determine the count of Leaf nodes in an N-ary tree
- Count the number of nodes at given level in a tree using BFS.
- Count nodes with two children at level L in a Binary Tree
- Program to count leaf nodes in a binary tree
- Iterative program to count leaf nodes in a Binary Tree
- Count half nodes in a Binary tree (Iterative and Recursive)
- Count full nodes in a Binary tree (Iterative and Recursive)
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.