ExamSIDE (Powered by ExamGOAL)
Questions
NEXT
1
GATE CSE 2022
Numerical
+1
-0.33

Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index ___________.

Your input ____
2
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the postorder traversal of the tree?
A
20, 19, 18, 16, 15, 12, 11, 10
B
10, 11, 12, 15, 16, 18, 19, 20
C
11, 12, 10, 16, 19, 18, 20, 15
D
19, 16, 18, 20, 11, 12, 10, 15
3
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
What is the worst case time complexity of inserting n2 elements into an AVL-tree with n elements initially?
A
$$\Theta \left( {{n^2}} \right)$$
B
$$\Theta \left( {{n^2}\log n} \right)$$
C
$$\Theta \left( {{n^4}} \right)$$
D
$$\Theta \left( {{n^3}} \right)$$
4
GATE CSE 2018
Numerical
+1
-0
The postorder traversal of a binary tree is $$8,9,6,7,4,5,2,3,1.$$ The inorder traversal of the same tree is $$8,6,9,4,7,2,5,1,3.$$ The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is ______.
Your input ____
NEXT
GATE CSE Subjects
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
Theory of Computation
Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability
Operating Systems
Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection
Digital Logic
K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits
Computer Organization
Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory
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
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts
Compiler Design
Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization
Software Engineering
Software Engineering
Web Technologies
Web Technologies
General Aptitude
Numerical Ability Verbal Ability
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSATMHT CETKCETCOMEDKVITEEE
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12