PREVIOUS NEXT
1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
How many distinct binary search trees can be created out of 4 distinct keys?
A
5
B
14
C
24
D
42
2
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Postorder traversal of a given binary search tree T produces the following sequence of keys 10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29 Which one of the following sequences of keys can be the result of an inorder traversal of the tree T?
A
9, 10, 15, 22, 23, 25, 27, 29, 40, 50, 60, 95
B
9, 10, 15, 22, 40, 50, 60, 95, 23, 25, 27, 29
C
29, 15, 9, 10, 25, 22, 23, 27, 40, 60, 50, 95
D
95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29
3
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is
A
nk
B
(n – 1)k + 1
C
n(k – 1) + 1
D
n(k – 1)
4
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
A binary search tree contains the numbers 1, 2, 3, 4, 5, 6, 7, 8. When the tree is traversed in pre-order and the values in each node printed out, the sequence of values obtained is 5, 3, 1, 2, 4, 6, 8, 7. If the tree is traversed in post-order, the sequence obtained would be
A
8, 7, 6, 5, 4, 3, 2, 1
B
1, 2, 3, 4, 8, 7, 6, 5
C
2, 1, 4, 3, 6, 7, 8, 5
D
2, 1, 4, 3, 7, 8, 6, 5
PREVIOUS NEXT

GATE CSE Subjects

Browse all chapters by subject

Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Undecidability Recursively Enumerable Language and Turing Machine
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts
Digital Logic
Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits
Database Management System
Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing
Data Structures
Arrays Stacks and Queues Linked List Trees Graphs Hashing
Computer Networks
Concepts of Layering Data Link Layer and Switching Network Layer Application Layer Protocol Routing Algorithm TCP UDP Sockets and Congestion Control Lan Technologies and Wi-Fi Network Security
Software Engineering
Software Engineering
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Web Technologies
Web Technologies
General Aptitude
Verbal Ability Logical Reasoning Numerical Ability
Discrete Mathematics
Set Theory & Algebra Linear Algebra Graph Theory Combinatorics Mathematical Logic Probability Calculus
Programming Languages
Basic of Programming Language Function and Recursion Pointer and Structure in C
Computer Organization
Computer Arithmetic Pipelining Machine Instructions and Addressing Modes Memory Interfacing IO Interface Alu Data Path and Control Unit Secondary Memory
EXAM MAP

Browse past year questions by exam & subject

Joint Entrance Examination
JEE Main JEE Advanced MHT CET BITSAT COMEDK WB JEE KCET VITEEE AP EAPCET TS EAMCET IAT (IISER)
Medical
NEET AIIMS MHT CET (Biology)
Graduate Aptitude Test in Engineering
GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN GATE Data Science and Artificial Intelligence
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12