Which of the following data structures is best suited for implementing a priority queue with O(log n) insert and O(log n) delete-min ?
Asked in TPSC Junior System Engineer 2026
Answer under review: our editors are checking this question. Try the other TPSC Prelims previous year questions questions meanwhile.
More TPSC Prelims previous year questions questions
- If a stack supports push and pop operations, and we push 1, 2, 3, 4, 5 in order and intermix pops, which sequence is NOT a valid pop sequence ?
- What is the height of an AVL tree with n nodes in the worst case ?
- In Object-Oriented Design, which principle states that a class should have only one reason to change ?
- Which OOP concept allows a subclass object to be used wherever a superclass object is expected, without altering program correctness ?
- In C++, what is the output of the following code ? int x = 5; int& ref = x; ref = 10 cout << x;
- Which of the following correctly describes ‘Abstract Class’ in OOP ?
- In OMT (Object Modeling Technique) methodology, which of the following models captures system behavior over time ?
- What is the key difference between OOA (Object-Oriented Analysis) and OOD (Object-Oriented Design) ?