GATE CS 2022 : Data Structure-1

Consider the following function implemented in C:
void printxy(int x, int y)
{
  int *ptr;
  x = 0;
  ptr = &x;
  y = * ptr;
  * ptr = 1;
  printf (“%d, %d,” x, y);
}

The output of invoking printxy (1, 1) is

The post order traversal of binary search tree is given by 2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12. The height of the tree is ________.

Consider generating Binary Search trees using a given set of numbers in the following order. Which of the following sequence of numbers will result in a tree that is strictly binary tree, i.e., every node has either two children or no children?

Let T be a binary search tree with 14 nodes and 60 as the external path length. Then the internal path length will be

Consider the following C program.
# include<stdio.h>
int main( )
{
  static int a[] = {10, 20, 30, 40, 50};
  static int *p[] = {a, a+3, a+4, a+1, a+2};
  int **ptr = p;
  ptr++;
  printf("%d%d", ptr - p, **ptr);
}