#include <stdio.h>
int foo(int S[],int size){
if(size == 0) return 0;
if(size == 1) return 1;
if(S[0] ≠ S[1]) return 1+foo(S+1,size-1);
return foo(S+1,size-1);
}
int main(){
int A[]={0,1,2,2,2,0,0,1,1};
printf("%d",foo(A,9));
return 0;
}Which of the following statement(s) is/are TRUE for any binary search tree (BST) having n distinct integers?
```c #include <stdio.h> void foo(int *p, int x){ *p=x; } int main(){ int *z; int a = 20, b = 25; z = &a; foo(z,b); pri…
The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node. Suppose a…
Let LIST be a datatype for an implementation of linked list defined as follows: ```c typedef struct list { int data; struct li…
```c #include <stdio.h> int gate (int n) { int d, t, newnum, turn; newnum = turn = 0; t=1; while (n≥t) t *= 10; t /=10; …
In a double hashing scheme, h1(k) = k mod 11 and h2(k) = 1 + (k mod 7) are the auxiliary hash functions. The size m of the hash ta…
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.