int f(int &x, int c) {
c = c - 1;
if (c == 0)
return 1;
x = x + 1;
return f(x, c) * x;
}The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the p…
The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the p…
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary se…
Match the problem domains in GROUP I with the solution technologies in GROUP II. | GROUP I | GROUP II | |---|---| | (P) Service o…
The figure represents access graphs of two modules M1 and M2. The filled circles represent methods and the unfilled circles repres…
The procedure below must find and replace characters in input array A. Characters to be replaced are in oldc, and their respective…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.