GATE CSE 2011 | Trees Question 31 | Data Structures

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 64 English Option 1

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

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

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

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

Which of the following is TRUE?

The cost of searching an AVL tree is θ (log n) but that of a binary search tree is O(n)

The cost of searching an AVL tree is θ (log n) but that of a complete binary tree is θ (n log n)

The cost of searching a binary search tree is O (log n ) but that of an AVL tree is θ(n)

The cost of searching an AVL tree is θ (n log n) but that of a binary search tree is O(n)

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

The maximum number of binary trees that can be formed with three unlabeled nodes is:

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:

2^h-1

2^h-1-1

2^h+1-1

2^h+1

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

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

Structured Query Language Transactions and Concurrency Functional Dependencies and Normalization Relational Algebra File Structures and Indexing Er Diagrams

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

Discrete Mathematics

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

Programming Languages

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

Computer Organization

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