GATE CSE 1996 | Trees Question 74 | Data Structures

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

In the balanced binary tree in Fig. given below, how many nodes will become unbalanced when a node is inserted as a child of the node “g”? GATE CSE 1996 Data Structures - Trees Question 76 English

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

Which of the following sequences denotes the post order traversal sequence of the tree of previous question?

f e g c d b a

g c b d a f e

g c d b f e a

f e d g c b a

GATE CSE 1995

MCQ (Single Correct Answer)

-0.3

A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is:

log₂n

n − 1

GATE CSE 1987

True or False

-0

It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.

TRUE

FALSE

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

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits 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

Arrays Stacks and Queues Linked List Trees Graphs Hashing

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 Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory