## Data Structures | Queue | Question 11

Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do? filter_none edit close play_arrow link brightness_4 code… Read More »

## Data Structures | Linked List | Question 14

Is it possible to create a doubly linked list using only one pointer with every node. (A) Not Possible (B) Yes, possible by storing XOR… Read More »

## Data Structures | Linked List | Question 13

What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the… Read More »

## Data Structures | Heap | Question 11

Given two max heaps of size n each, what is the minimum possible time complexity to make a one max-heap of size from elements of… Read More »

## Data Structures | Misc | Question 10

Which of the following data structures is best suited for efficient implementation of priority queue? (A) Array (B) Linked List (C) Heap (D) Stack Answer:… Read More »

## Data Structures | Misc | Question 9

Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data… Read More »

## Data Structures | Misc | Question 8

Which data structure is best suited for converting recursive implementation to iterative implementation of an algorithm? (A) Queue (B) Stack (C) Tree (D) Graph Answer:… Read More »

## Data Structures | Graph | Question 9

Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices is (A) E (B) 2E (C)… Read More »

## Data Structures | Binary Trees | Question 15

Consider a node X in a Binary Tree. Given that X has two children, let Y be Inorder successor of X. Which of the following… Read More »

## Data Structures | B and B+ Trees | Question 4

Which of the following is FALSE about B/B+ tree (A) B/B+ trees grow upward while Binary Search Trees grow downward. (B) Time complexity of search… Read More »

## Data Structures | Binary Search Trees | Question 12

Consider the same code as given in above question. What does the function print() do in general? The function print() receives root of a Binary… Read More »

## Data Structures | Binary Search Trees | Question 12

Consider the following code snippet in C. The function print() receives root of a Binary Search Tree (BST) and a positive integer k as arguments.… Read More »

## Data Structures | Misc | Question 7

Which among the following data structures is best suited for storing very large numbers (numbers that cannot be stored in long long int). Following are… Read More »

## Data Structures | Binary Search Trees | Question 10

Which of the following traversals is sufficient to construct BST from given traversals 1) Inorder 2) Preorder 3) Postorder (A) Any one of the given… Read More »

## Data Structures | Balanced Binary Search Trees | Question 11

What is the worst case possible height of Red-Black tree? Assume base of Log as 2 in all options (A) 2Log(n+1) (B) 1.44 Logn (C)… Read More »