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 2015 Set 3
Numerical
+1
-0
Consider a binary tree $$T$$ that has $$200$$ leaf nodes. Then, the number of nodes in $$T$$ that have exactly two children are ________.
Your input ____
4
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
While inserting the elements $$71, 65, 84, 69, 67, 83$$ in an empty binary search tree $$(BST)$$ in the sequence shown, the element in the lowest level is
A
$$65$$
B
$$67$$
C
$$69$$
D
$$83$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12