1
GATE CSE 2025 Set 1
MCQ (More than One Correct Answer)
+1
-0
Which of the following statement(s) is/are TRUE for any binary search tree (BST) having $n$ distinct integers?
2
GATE CSE 2025 Set 1
Numerical
+1
-0
The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node.
Suppose a Min-Heap $T$ stores 32 keys. The height of $T$ is ________ (Answer in integer)
Your input ____
3
GATE CSE 2023
MCQ (Single Correct Answer)
+1
-0.33
Which one of the following sequences when stored in an array at locations $$A[1],....,A[10]$$ forms a max-heap?
4
GATE CSE 2022
Numerical
+1
-0
Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index ___________.
Your input ____
Questions Asked from Trees (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
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 2015 Set 3 (2)
GATE CSE 2015 Set 1 (3)
GATE CSE 2015 Set 2 (2)
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
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages