GATE CSE 2006 | Trees Question 64 | Data Structures | GATE CSE - ExamSIDE.com

1

GATE CSE 2006

MCQ (Single Correct Answer)

+2

-0.6

Suppose that we have numbers between 1 and 100 in a binary search tree and want to search for the number 55. Which of the following sequences CANNOT be the sequence of nodes examined?

A

{10, 75, 64, 43, 60, 57, 55}

B

{90, 12, 68, 34, 62, 45, 55}

C

{9, 85, 47, 68, 43, 57, 55}

D

{79, 14, 72, 56, 16, 53, 55}

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

How many distinct binary search trees can be created out of 4 distinct keys?

A

5

B

14

C

24

D

42

4

GATE CSE 2005

MCQ (Single Correct Answer)

+2

-0.6

In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2. If the height of the tree is h > 0, then the minimum number of nodes in the tree is:

A

2^{h – 1}

B

2^{h – 1} + 1

C

2^h – 1

D

2^h

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

P and NP Concepts Searching and Sorting Greedy Method Dynamic Programming Complexity Analysis and Asymptotic Notations Divide and Conquer Method

Digital Logic

Sequential Circuits Boolean Algebra K Maps Combinational Circuits Number Systems

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

Syntax Directed Translation Parsing Lexical Analysis 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

Staff Selection Commission

CBSE