1
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Consider a complete binary tree where the left and the right sub-trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is
A
$$\Omega \left( {\log \,\,n} \right)$$
B
$$\Omega \left( n \right)$$
C
$$\Omega \left( {n\,\,\log \,\,n} \right)$$
D
$$\Omega \left( {{n^2}} \right)$$
2
GATE CSE 2015 Set 2
Numerical
+1
-0
A binary tree $$T$$ has $$20$$ leaves. The number of nodes in $$T$$ having two children is _______________.
Your input ____
3
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the following rooted tree with the vertex labelled P as the root GATE CSE 2014 Set 3 Data Structures - Trees Question 70 English The order in which the nodes are visited during an in-order traversal of the tree is
A
SQPTRWUV
B
SQPTRUWRV
C
SQPTWUVR
D
SQPTRUWV
4
GATE CSE 2014 Set 1
Numerical
+1
-0
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes O(na Logbn ). Then the value of a + 10b is _________
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP