1
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 ____
2
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
A
63 and 6, respectively
B
64 and 5, respectively
C
32 and 6, respectively
D
31 and 5, respectively
3
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?

I. 3, 5, 7, 8, 15, 19, 25
II. 5, 8, 9, 12, 10, 15, 25
III. 2, 7, 10, 8, 14, 16, 20
IV. 4, 6, 7, 9 18, 20, 25

A
I and IV only
B
II and III only
C
II and IV only
D
II only
4
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
A
$$\Theta \left( {\log n} \right)$$ for both insertion and deletion
B
$$\Theta \left( n \right)$$ for both insertion and deletion
C
$$\Theta \left( n \right)$$ for insertion and $$\Theta \left( {\log n} \right)$$for deletion
D
$$\Theta \left( {\log n} \right)$$ for insertion and $$\Theta \left( n \right)$$ for deletion
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