GATE 2013 · session-1
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
Related Programming & Data Structures PYQs
The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the p…
The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the p…
Match the problem domains in GROUP I with the solution technologies in GROUP II. | GROUP I | GROUP II | |---|---| | (P) Service o…
The figure represents access graphs of two modules M1 and M2. The filled circles represent methods and the unfilled circles repres…
What is the return value of f(p,p), if p is initialized to 5 before the call? The first parameter is passed by reference, whereas …
The procedure below must find and replace characters in input array A. Characters to be replaced are in oldc, and their respective…
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.