1
GATE CSE 2023
MCQ (Single Correct Answer)
+2
-0.67
Consider the C function foo and the binary tree shown.
typedef struct node {
int val;
struct node *left, *right;
} node;
int foo(node *p) {
int retval;
if (p == NULL)
return 0;
else {
retval = p->val + foo(p->left) + foo(p->right);
printf("%d ", retval);
return retval;
}
}
When foo is called with a pointer to the root node of the given binary tree, what will it print?
2
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+2
-0.67
A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than the maximum element in T?
3
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+2
-0.67
Consider the following statements.
S1 : The sequence of procedure calls corresponds to a preorder traversal of the activation tree.
S2 : The sequence of procedure returns corresponds to a postorder traversal of the activation tree.
Which one of the following options is correct?
4
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a, b]? Assume that the number of reported elements is k.
Questions Asked from Trees (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2023 (2)
GATE CSE 2021 Set 1 (2)
GATE CSE 2020 (2)
GATE CSE 2019 (1)
GATE CSE 2016 Set 2 (2)
GATE CSE 2014 Set 3 (3)
GATE CSE 2014 Set 2 (1)
GATE CSE 2012 (1)
GATE CSE 2011 (1)
GATE CSE 2009 (1)
GATE CSE 2008 (5)
GATE CSE 2007 (4)
GATE CSE 2006 (5)
GATE CSE 2005 (6)
GATE CSE 2004 (3)
GATE CSE 2002 (1)
GATE CSE 2000 (1)
GATE CSE 1998 (1)
GATE CSE 1997 (1)
GATE CSE 1996 (2)
GATE CSE 1991 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages