GATE CSE 2015 Set 3 | Trees Question 31 | Data Structures

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 ____

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

-0.3

The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are

63 and 6, respectively

64 and 5, respectively

32 and 6, respectively

31 and 5, respectively

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 1

MCQ (Single Correct Answer)

-0.3

Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?

I. 3, 5, 7, 8, 15, 19, 25
II. 5, 8, 9, 12, 10, 15, 25
III. 2, 7, 10, 8, 14, 16, 20
IV. 4, 6, 7, 9 18, 20, 25

I and IV only

II and III only

II and IV only

II only

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

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

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

Compiler Design

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

Function and Recursion Basic of Programming Language 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