ExamSIDE
Questions (Powered by ExamGOAL)
Data Structures
Arrays
Marks 1Marks 2
Stacks and Queues
Marks 1Marks 2
Linked List
Marks 1Marks 2
Trees
Marks 1Marks 2
Graphs
Marks 1Marks 2
Hashing
Marks 1Marks 2
Previous Next
1
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)
2
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
3
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:
A
2h-1
B
2h-1-1
C
2h+1-1
D
2h+1
4
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
In a binary tree, the number of internal nodes of degree 1 is 5, and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is
A
10
B
11
C
12
D
15
Previous Next
Questions Asked from Marks 1
GATE CSE 2025 Set 2 (2) GATE CSE 2025 Set 1 (3) GATE CSE 2023 (1) GATE CSE 2022 (1) GATE CSE 2021 Set 2 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2020 (2) GATE CSE 2018 (1) GATE CSE 2017 Set 1 (1) GATE CSE 2015 Set 3 (2) GATE CSE 2015 Set 2 (2) GATE CSE 2015 Set 1 (3) GATE CSE 2014 Set 3 (1) GATE CSE 2014 Set 1 (1) GATE CSE 2011 (1) GATE CSE 2008 (1) GATE CSE 2007 (2) GATE CSE 2006 (2) GATE CSE 2005 (1) GATE CSE 2004 (2) GATE CSE 2003 (1) GATE CSE 2000 (1) GATE CSE 1998 (1) GATE CSE 1996 (2) GATE CSE 1995 (1) GATE CSE 1987 (2)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization