1
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 ____
2
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
A
GATE CSE 2011 Data Structures - Trees Question 61 English Option 1
B
GATE CSE 2011 Data Structures - Trees Question 61 English Option 2
C
GATE CSE 2011 Data Structures - Trees Question 61 English Option 3
D
GATE CSE 2011 Data Structures - Trees Question 61 English Option 4
3
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is TRUE?
A
The cost of searching an AVL tree is θ (log n) but that of a binary search tree is O(n)
B
The cost of searching an AVL tree is θ (log n) but that of a complete binary tree is θ (n log n)
C
The cost of searching a binary search tree is O (log n ) but that of an AVL tree is θ(n)
D
The cost of searching an AVL tree is θ (n log n) but that of a binary search tree is O(n)
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
The maximum number of binary trees that can be formed with three unlabeled nodes is:
A
1
B
5
C
4
D
3
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
Defence
NDA
CBSE
Class 12