GATE CSE 2015 Set 1 | Trees Question 30 | 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 2014 Set 3

MCQ (Single Correct Answer)

-0.3

Consider the following rooted tree with the vertex labelled P as the root GATE CSE 2014 Set 3 Data Structures - Trees Question 70 English

The order in which the nodes are visited during an in-order traversal of the tree is

SQPTRWUV

SQPTRUWRV

SQPTWUVR

SQPTRUWV

GATE CSE 2014 Set 1

Numerical

-0

Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes O(n^a Log^bn ). Then the value of a + 10b is _________

Your input ____

GATE CSE 2011

MCQ (Single Correct Answer)

-0.3

A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?

GATE CSE 2011 Data Structures - Trees Question 71 English Option 1

GATE CSE 2011 Data Structures - Trees Question 71 English Option 2

GATE CSE 2011 Data Structures - Trees Question 71 English Option 3

GATE CSE 2011 Data Structures - Trees Question 71 English Option 4

PREVIOUS NEXT

GATE CSE Subjects

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 P and NP Concepts Dynamic Programming

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

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