GATE | Sudo GATE 2020 Mock III (24 January 2019) | Question 30

Consider the same code as given in below question. The function print() receives root of a Binary Search Tree (BST) and a positive integer k as arguments.

// A BST node
struct node {
    int data;
    struct node *left, *right;
};

int count = 0;

void print(struct node *root, int k)
{
    if (X)
    {
        print(Y);
        count++;
        if (count == k)
          printf(\"%d \", root->data);
       print(root->left, k);
    }
}

If function print() prints the kth largest element in BST, then what should be X and Y?

(A)

X = root != NULL && count >= k and Y = root->right, k

(B)

X = root != NULL && count <= k and Y = root->right

(C)

X = root != NULL && count >= k and Y = root->right

(D)

X = root != NULL && count <= k and Y = root->right, k

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News