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 trav…
What is the worst case time complexity of inserting n^2 elements into an AVL-tree with n elements initially?
What is the worst case time complexity of inserting n elements into an empty linked list, if the linked list needs to be maintaine…
Consider the following C program: ```c #include <stdio.h> int main() { int a[4][5] = { {1, 2, 3, 4, 5}, {6, 7…
In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a, b]…
Consider the following C functions: ```c int fun1(int n) { static int i = 0; if (n > 0) { ++i; fun1(n - 1…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.