# Count the nodes of a tree whose weighted string is an anagram of the given string

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weighted string is an anagram with the given string str.

Examples:

Input: str = “geek”
Output: 2
Only the weighted strings of the nodes 2 and 6
are anagrams of the given string “geek”.

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: Perform dfs on the tree and for every node, check if it’s weighted string is anagram with the given string or not, If not then increment the count.

Below is the implementation of the above approach:

## C++

 `// C++ implementation of the approach ` `#include ` `using` `namespace` `std; ` ` `  `string s; ` `int` `cnt = 0; ` ` `  `vector<``int``> graph; ` `vector weight(100); ` ` `  `// Function that return true if both ` `// the strings are anagram of each other ` `bool` `anagram(string x, string s) ` `{ ` `    ``sort(x.begin(), x.end()); ` `    ``sort(s.begin(), s.end()); ` `    ``if` `(x == s) ` `        ``return` `true``; ` `    ``else` `        ``return` `false``; ` `} ` ` `  `// Function to perform dfs ` `void` `dfs(``int` `node, ``int` `parent) ` `{ ` `    ``// If current node's weighted ` `    ``// string is an anagram of ` `    ``// the given string s ` `    ``if` `(anagram(weight[node], s)) ` `        ``cnt += 1; ` ` `  `    ``for` `(``int` `to : graph[node]) { ` `        ``if` `(to == parent) ` `            ``continue``; ` `        ``dfs(to, node); ` `    ``} ` `} ` ` `  `// Driver code ` `int` `main() ` `{ ` `    ``s = ``"geek"``; ` ` `  `    ``// Weights of the nodes ` `    ``weight = ``"eeggk"``; ` `    ``weight = ``"geek"``; ` `    ``weight = ``"gekrt"``; ` `    ``weight = ``"tree"``; ` `    ``weight = ``"eetr"``; ` `    ``weight = ``"egek"``; ` ` `  `    ``// Edges of the tree ` `    ``graph.push_back(2); ` `    ``graph.push_back(3); ` `    ``graph.push_back(4); ` `    ``graph.push_back(5); ` `    ``graph.push_back(6); ` ` `  `    ``dfs(1, 1); ` ` `  `    ``cout << cnt; ` ` `  `    ``return` `0; ` `} `

## Java

 `// Java implementation of the approach ` `import` `java.util.*; ` ` `  `class` `GFG  ` `{ ` ` `  `    ``static` `String s; ` `    ``static` `int` `cnt = ``0``; ` ` `  `    ``static` `Vector[] graph = ``new` `Vector[``100``]; ` `    ``static` `String[] weight = ``new` `String[``100``]; ` ` `  `    ``// Function that return true if both ` `    ``// the Strings are anagram of each other ` `    ``static` `boolean` `anagram(String x, String s)  ` `    ``{ ` `        ``x = sort(x); ` `        ``s = sort(s); ` `        ``if` `(x.equals(s)) ` `            ``return` `true``; ` `        ``else` `            ``return` `false``; ` `    ``} ` ` `  `    ``static` `String sort(String inputString)  ` `    ``{ ` `        ``// convert input string to char array ` `        ``char` `tempArray[] = inputString.toCharArray(); ` ` `  `        ``// sort tempArray ` `        ``Arrays.sort(tempArray); ` ` `  `        ``// return new sorted string ` `        ``return` `new` `String(tempArray); ` `    ``} ` ` `  `    ``// Function to perform dfs ` `    ``static` `void` `dfs(``int` `node, ``int` `parent) ` `    ``{ ` `        ``// If current node's weighted ` `        ``// String is an anagram of ` `        ``// the given String s ` `        ``if` `(anagram(weight[node], s)) ` `            ``cnt += ``1``; ` ` `  `        ``for` `(``int` `to : graph[node]) ` `        ``{ ` `            ``if` `(to == parent) ` `                ``continue``; ` `            ``dfs(to, node); ` `        ``} ` `    ``} ` ` `  `    ``// Driver code ` `    ``public` `static` `void` `main(String[] args)  ` `    ``{ ` `        ``s = ``"geek"``; ` `        ``for` `(``int` `i = ``0``; i < ``100``; i++) ` `            ``graph[i] = ``new` `Vector(); ` `         `  `        ``// Weights of the nodes ` `        ``weight[``1``] = ``"eeggk"``; ` `        ``weight[``2``] = ``"geek"``; ` `        ``weight[``3``] = ``"gekrt"``; ` `        ``weight[``4``] = ``"tree"``; ` `        ``weight[``5``] = ``"eetr"``; ` `        ``weight[``6``] = ``"egek"``; ` ` `  `        ``// Edges of the tree ` `        ``graph[``1``].add(``2``); ` `        ``graph[``2``].add(``3``); ` `        ``graph[``2``].add(``4``); ` `        ``graph[``1``].add(``5``); ` `        ``graph[``5``].add(``6``); ` ` `  `        ``dfs(``1``, ``1``); ` ` `  `        ``System.out.print(cnt); ` `    ``} ` `} ` ` `  `// This code is contributed by Rajput-Ji `

## Python3

 `# Python3 implementation of the approach  ` `cnt ``=` `0` ` `  `graph ``=` `[[] ``for` `i ``in` `range``(``100``)] ` `weight ``=` `[``0``] ``*` `100` ` `  `# Function that return true if both  ` `# the strings are anagram of each other  ` `def` `anagram(x, s): ` `    ``x ``=` `sorted``(``list``(x))  ` `    ``s ``=` `sorted``(``list``(s)) ` `    ``if` `(x ``=``=` `s): ` `        ``return` `True` `    ``else``: ` `        ``return` `False` ` `  `# Function to perform dfs  ` `def` `dfs(node, parent): ` `    ``global` `cnt, s ` `     `  `    ``# If weight of the current node  ` `    ``# string is an anagram of  ` `    ``# the given string s  ` `    ``if` `(anagram(weight[node], s)): ` `        ``cnt ``+``=` `1` `    ``for` `to ``in` `graph[node]: ` `        ``if` `(to ``=``=` `parent): ` `            ``continue` `        ``dfs(to, node) ` ` `  `# Driver code  ` `s ``=` `"geek"` ` `  `# Weights of the nodes  ` `weight[``1``] ``=` `"eeggk"` `weight[``2``] ``=` `"geek"` `weight[``3``] ``=` `"gekrt"` `weight[``4``] ``=` `"tree"` `weight[``5``] ``=` `"eetr"` `weight[``6``] ``=` `"egek"` ` `  `# Edges of the tree  ` `graph[``1``].append(``2``) ` `graph[``2``].append(``3``) ` `graph[``2``].append(``4``) ` `graph[``1``].append(``5``) ` `graph[``5``].append(``6``) ` ` `  `dfs(``1``, ``1``) ` `print``(cnt) ` ` `  `# This code is contributed by SHUBHAMSINGH10 `

## C#

 `// C# implementation of the approach ` `using` `System; ` `using` `System.Collections.Generic; ` ` `  `class` `GFG  ` `{ ` ` `  `    ``static` `String s; ` `    ``static` `int` `cnt = 0; ` ` `  `    ``static` `List<``int``>[] graph = ``new` `List<``int``>; ` `    ``static` `String[] weight = ``new` `String; ` ` `  `    ``// Function that return true if both ` `    ``// the Strings are anagram of each other ` `    ``static` `bool` `anagram(String x, String s)  ` `    ``{ ` `        ``x = sort(x); ` `        ``s = sort(s); ` `        ``if` `(x.Equals(s)) ` `            ``return` `true``; ` `        ``else` `            ``return` `false``; ` `    ``} ` ` `  `    ``static` `String sort(String inputString)  ` `    ``{ ` `        ``// convert input string to char array ` `        ``char` `[]tempArray = inputString.ToCharArray(); ` ` `  `        ``// sort tempArray ` `        ``Array.Sort(tempArray); ` ` `  `        ``// return new sorted string ` `        ``return` `new` `String(tempArray); ` `    ``} ` ` `  `    ``// Function to perform dfs ` `    ``static` `void` `dfs(``int` `node, ``int` `parent) ` `    ``{ ` `        ``// If current node's weighted ` `        ``// String is an anagram of ` `        ``// the given String s ` `        ``if` `(anagram(weight[node], s)) ` `            ``cnt += 1; ` ` `  `        ``foreach` `(``int` `to ``in` `graph[node]) ` `        ``{ ` `            ``if` `(to == parent) ` `                ``continue``; ` `            ``dfs(to, node); ` `        ``} ` `    ``} ` ` `  `    ``// Driver code ` `    ``public` `static` `void` `Main(String[] args)  ` `    ``{ ` `        ``s = ``"geek"``; ` `        ``for` `(``int` `i = 0; i < 100; i++) ` `            ``graph[i] = ``new` `List<``int``>(); ` `         `  `        ``// Weights of the nodes ` `        ``weight = ``"eeggk"``; ` `        ``weight = ``"geek"``; ` `        ``weight = ``"gekrt"``; ` `        ``weight = ``"tree"``; ` `        ``weight = ``"eetr"``; ` `        ``weight = ``"egek"``; ` ` `  `        ``// Edges of the tree ` `        ``graph.Add(2); ` `        ``graph.Add(3); ` `        ``graph.Add(4); ` `        ``graph.Add(5); ` `        ``graph.Add(6); ` ` `  `        ``dfs(1, 1); ` ` `  `        ``Console.Write(cnt); ` `    ``} ` `} ` ` `  `// This code is contributed by PrinciRaj1992 `

Output:

```2
```

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.