Question
Time complexity of heap sort is:
More Data Structure Questions
- Which sorting algorithm has O(n log n) average case?
- What is the postorder traversal of the BST built by inserting 50, 30, 70, 20, 40, 60, 80, 10 in this order?
- A DAG has edges A→C, B→C, C→D and B→D. Which is a valid topological ordering?
- What is a 'Hash Table' and how does it handle 'collisions'?
- Which traversal of binary tree gives nodes in sorted order?
- The amortized cost of appending an element at the end of a dynamic array is:
- Which algorithm is used for computing Max-Flow in a network?
- Using an explicit stack for iterative DFS starting at A, where each node's neighbors are pushed onto the stack in the listed order (A:[B,C,D], B:[E], C:[],...
- A hash table uses open addressing with linear probing. Which deletion method preserves successful searches without requiring rehashing the entire table?
- What is the best-case time complexity of the binary search algorithm?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)