In a doubly linked list, deleting a node given only a pointer to that node (not to its predecessor) has time complexity
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
- The nost-order traversal of a Binavr Search Tree having keys. 10, 20, 5, 15, 1 (inserted in this order) yields which sequence ?
- Which of the following graph representations is most efficient for a sparse graph with V vertices and E edges where E << V^2 ?
- A min-heap contains n elements. What is the time complexity of extracting all elements in sorted order (heap sort) ?
- Which hashing technique handles collisions by computing a second hash function to find the next probe position ?
- In Quick Sort, choosing the pivot as the median-of-three reduces the probability of O(n²) worst-case. Under what input condition does Quick Sort still degrade to O(n²) ?
- 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 ?
- 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 ?