• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests
Interview Preparation
Practice @Geeksforgeeks
Data Structures
Algorithms
Programming Languages
Web Technologies
Computer Science Subjects
Data Science & ML
Tutorial Library
GATE CS
DevOps
QUIZ Section
School Content
Commerce

Data Structures | Binary Search Trees | Question 12

Consider the following code snippet in C. The function print() receives root of a Binary Search Tree (BST) and a positive integer k as arguments. C 
// A BST node
struct node {
    int data;
    struct node *left, *right;
};

int count = 0;

void print(struct node *root, int k)
{
    if (root != NULL && count <= k)
    {
        print(root->right, k);
        count++;
        if (count == k)
          printf(\"%d \", root->data);
       print(root->left, k);
    }
}
What is the output of print(root, 3) where root represent root of the following BST. 
                   15
                /     \\
              10      20
             / \\     /  \\
            8  12   16  25

(A)

10

(B)

16

(C)

20

(D)

20 10

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

Trending in News

View More