GATE CSE 2015 Set 1 | Trees Question 14 | Data Structures

PREVIOUS NEXT

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

-0.3

What are the worst-case complexities of insertion and deletion of a key in a binary search tree?

$$\Theta \left( {\log n} \right)$$ for both insertion and deletion

$$\Theta \left( n \right)$$ for both insertion and deletion

$$\Theta \left( n \right)$$ for insertion and $$\Theta \left( {\log n} \right)$$for deletion

$$\Theta \left( {\log n} \right)$$ for insertion and $$\Theta \left( n \right)$$ for deletion

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-0.3

Consider a complete binary tree where the left and the right sub-trees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is

$$\Omega \left( {\log \,\,n} \right)$$

$$\Omega \left( n \right)$$

$$\Omega \left( {n\,\,\log \,\,n} \right)$$

$$\Omega \left( {{n^2}} \right)$$

GATE CSE 2015 Set 2

Numerical

-0

A binary tree $$T$$ has $$20$$ leaves. The number of nodes in $$T$$ having two children is _______________.

Your input ____

GATE CSE 2015 Set 3

Numerical

-0

Consider a binary tree $$T$$ that has $$200$$ leaf nodes. Then, the number of nodes in $$T$$ that have exactly two children are ________.

Your input ____

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language 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

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Numerical Ability

Discrete Mathematics

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory