1
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
A complete n-ary tree is one in which every node has O or n sons. If x is the number of internal nodes of a complete n-ary tree, the number of leaves in it is given by
A
x(n – 1) +1
B
xn - 1
C
xn + 1
D
x(n+1)
2
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
A binary search tree contains the value 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in pre-order and the values are printed out. Which of the following sequences is a valid output?
A
5 3 1 2 4 7 8 6
B
5 3 1 2 6 4 8 7
C
5 3 2 4 1 6 7 8
D
5 3 1 2 4 7 6 8
3
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24 The number of nodes in the left subtree and right subtree of the root respectively is
A
(4, 7)
B
(7, 4)
C
(8, 3)
D
(8, 3)
4
GATE CSE 1996
MCQ (More than One Correct Answer)
+2
-0.6
A binary search tree is used to locate the number 43. Which of the following probe sequences are not possible?
A
61 52 14 17 40 43
B
2 3 50 40 60 43
C
10 65 31 48 37 43
D
17 77 27 66 18 43
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12