Tries and Suffix
1. Which of the following is a prefix of the word 'ABRACADABRA'?
2. How many parents can each node (not the Root) of a Tree of Size N can have?
3. How many parents does the root of a tree of size N can have?
4. int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}
What is the time and space complexity for the above code?
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}
What is the time and space complexity for the above code?