Answer:
Follows are the method definition to this question:
void Reverse_Order(struct Node* h)//defining a recursive method Reverse_Order that takes structure in parameter
{
if (h == NULL)//use if block to check head equal to null
return;//use return keyword
Reverse_Order(h->next);//call method recursively
cout<<h->data;//print data
}
Explanation:
In the above code, a recursive method "Reverse_Order" takes structure as the parameter, and inside the method, structure variable h is used that uses the if conditional statement to check the header equal to null.
In the condition is true, it will use the return keyword, and in the next step, it calls the method recursively, and print its value in the reverse order.
Answer:
Number of strings = (10, 2)×(8,3) = 2520
Explanation:
The number of possible combinations for taking two 0's is C(10, 2)
It remains 8 Positions
The number of possible combinations for taking three 1's is C(8,3)
So there remains 5 spots
Answer:
I’m not sure if you can only teachers can acess that
Explanation:
