#include<stdio.h>
int funcp(){
static int x = 1;
x++;
return x;
}
int main(){
int x,y;
x = funcp();
y = funcp()+x;
printf("%d\n", (x+y));
return 0;
}Which one of the following sequences when stored in an array at locations A[1],...,A[10] forms a max-heap?
Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the …
An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize…
Let A be a priority queue for maintaining a set of elements. Suppose A is implemented using a max-heap data structure. The operati…
Consider a sequence a of elements a0=1, a1=5, a2=7, a3=8, a4=9, and a5=2. The following operations are performed on a stack S and …
Consider the C function foo and the binary tree shown. ```c typedef struct node { int val; struct node *left, *right; } n…
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.