Question

3) (10 pts) DSN (Advanced Tree Structures: Tries) Write a recursive function that takes the root of a trie and counts how many odd-lengthed strings there are in the trie. For example, if the trie contains the empty string (""), "bananas", "avocados", and "randomness", the function should return 1, because only one of those strings has a length that is odd ("bananas"). We will make our initial call to your function like so: countOddStrings (root, 0); Part of the fun in this problem is figuring out what to do with that second parameter. Please do NOT write any helper functions. Restrict yourself to the function whose signature is given below. typedef struct TrieNode { struct TrieNode children [26]; int flag; // 1 if the string is in the trie, 0 otherwise } TrieNode; int countOddStrings (TrieNode root, int k) {

          3) (10 pts) DSN (Advanced Tree Structures: Tries)
Write a recursive function that takes the root of a trie and counts how many odd-lengthed strings there
are in the trie. For example, if the trie contains the empty string (""), "bananas", "avocados", and
"randomness", the function should return 1, because only one of those strings has a length that is odd
("bananas").
We will make our initial call to your function like so: countOddStrings (root, 0);
Part of the fun in this problem is figuring out what to do with that second parameter.
Please do NOT write any helper functions. Restrict yourself to the function whose signature is given
below.
typedef struct TrieNode {
struct TrieNode *children [26];
int flag; // 1 if the string is in the trie, 0 otherwise
} TrieNode;
int countOddStrings (TrieNode *root, int k) {

3) (10 pts) DSN (Advanced Tree Structures: Tries)
Write a recursive function that takes the root of a trie and counts how many odd-lengthed strings there
are in the trie. For example, if the trie contains the empty string (""), "bananas", "avocados", and
"randomness", the function should return 1, because only one of those strings has a length that is odd
("bananas").
We will make our initial call to your function like so: countOddStrings (root, 0);
Part of the fun in this problem is figuring out what to do with that second parameter.
Please do NOT write any helper functions. Restrict yourself to the function whose signature is given
below.
typedef struct TrieNode
struct TrieNode *children [26];
int flag; // 1 if the string is in the trie, 0 otherwise
TrieNode;
int countOddStrings (TrieNode *root, int k)

Added by Tiffany W.

Question

Please give Ace some feedback