This question is based upon the figure shown below

Which of the following is the post–order traversal of the binary tree that is given in the image?

    abc a1;

    return 0;

}

Which of the following is true about 'a1'?

Analyse the given code and answer the following question.

#include <stdio.h>

int main()

{

    typedef char (*(*abc[4])())[10];

    abc a1;

    return 0;

}

Which of the following is true about 'a1'?

printf("%d %d",u,v);

funct1(&u,&v);

printf(" %d %d\n",u,v);

}

void funct1(int *pu, int *pv)

{

*pu=0;

*pv=0;

return;

}

What is the output of the following program ?

main()

{

int u = 1, v = 3;

printf("%d %d",u,v);

funct1(&u,&v);

printf(" %d %d\n",u,v);

}

void funct1(int *pu, int *pv)

{

*pu=0;

*pv=0;

return;

}

amessage++;

2.char *pmessage = "abcde";

(*pmessage)++;

3.char amessage[] = "lmnop";

(*amessage)++;

4.char *pmessage = "abcde";

pmessage++;

Which of the following statements is/are valid and correct?

1.char amessage[] = "lmnop";

amessage++;

2.char *pmessage = "abcde";

(*pmessage)++;

3.char amessage[] = "lmnop";

(*amessage)++;

4.char *pmessage = "abcde";

pmessage++;

k = search ( m, n);

if (k = = ( node *) NULL)

return;

p = k –> next;

k –>next = p –>next;

free (p);

}

What function will the following code perform?

void delete_element ( node *m, int n)

{

node *p, *k;

k = search ( m, n);

if (k = = ( node *) NULL)

return;

p = k –> next;

k –>next = p –>next;

free (p);

}