Answer:
#include <stdio.h>
int fib(int n) {
if (n <= 0) {
return 0;
}
if (n <= 2) {
return 1;
}
return fib(n-1) + fib(n-2);
}
int main(void) {
for(int nr=0; nr<=20; nr++)
printf("Fibonacci %d is %d\n", nr, fib(nr) );
return 0;
}
Explanation:
The code is a literal translation of the definition using a recursive function.
The recursive function is not per se a very efficient one.
Answer:
Let the function be Node* ins(Node *root,int k)
if root node is NULL then return new node with data equal to k.
If the k <root->data
root->left=ins(root->left,k);
else if k >root->data
root->right =ins(root->right,k);
At last return root.
Explanation:
Node is always inserted at the at the leaf node.We will search k in the tree if we hit a the leaf node the new node is inserted as the child of the leaf node.
Answer:
There are no statements in the question, so I explained the whole code.
Explanation:
A map consists of key - value pairs. The put method allows you to insert values in the map. The first parameter in the put method is the key, and the second one is the value. Also, the keys must be unique.
For example, map.put("123", "John Smith"); -> key = 123, value = John Smith
Even though the key 123 is set to John Smith at the beginning, it will have the updated value Steve Yao at the end. That is because the keys are unique.
Note that the key 222 also has Steve Yao for the value, that is totally acceptable.
Complete question is attached as snapshot.
Answer:
This will result in a compilation error.
Here's the inheritance hierarchy:
Meg -> Lois -> Brian -> Stewie
Now Meg has 2 public Fxns, a() and toString().
Lois inherits from Meg and all its public functions as well but, overrides the a() fxn of its super class.
So finally Lois has fxns a(), b() and toString().
Brian extends Lois and inherits all the above listed fxns of Lois, but overrides the b() and toString() fxns.
Stewie extends Brian and inherits all the fxns of Brian, but overrides the a() and toString() fxns.
In the Main driver fxn, we call a() and b() methods of all these classes but, the base class Meg has no b() and it is not extending any class so its not available in its scope.
This results in a compilation error.
Explanation:
