1
GATE CSE 2011
MCQ (Single Correct Answer)
+2
-0.6
We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?
2
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
How many distinct BSTs can be constructed with 3 distinct keys?
4
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
You are given the postorder traversal, P, of a binary search tree on the n elements 1, 2,..........., n. You have to determine the unique binary search tree that has P as its postorder traversal. What is the time complexity of the most efficient algorithm for doing this?
Questions Asked from Marks 2
GATE CSE 2025 Set 2 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (1) GATE CSE 2023 (2) GATE CSE 2020 (2) GATE CSE 2019 (1) GATE CSE 2016 Set 2 (2) GATE CSE 2014 Set 3 (3) GATE CSE 2014 Set 2 (1) GATE CSE 2012 (1) GATE CSE 2011 (1) GATE CSE 2009 (1) GATE CSE 2008 (5) GATE CSE 2007 (4) GATE CSE 2006 (5) GATE CSE 2005 (6) GATE CSE 2004 (3) GATE CSE 2002 (1) GATE CSE 2000 (1) GATE CSE 1998 (1) GATE CSE 1997 (1) GATE CSE 1996 (2) GATE CSE 1991 (1)
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