# Category Archives: Data Structures

## Data Structures | Heap | Question 12October 14, 2014

Which of the following Binary Min Heap operation has the highest time complexity? (A) Inserting an item under the assumption that the heap has capacity… Read More »

## Data Structures | Linked List | Question 17March 11, 2014

Consider the following function to traverse a linked list. Which of the following is FALSE about above function? (A) The function may crash when the… Read More »

## Data Structures | Balanced Binary Search Trees | Question 13February 5, 2014

Which of the following operations are used by Red-Black trees to maintain balance during insertion/deletion? a) Recoloring of nodes b) Rotation (Left and Right) (A)… Read More »

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

Is the following statement valid? A Red-Black Tree which is also a perfect Binary Tree can have all black nodes (A) Yes (B) No Answer:… Read More »

## Data Structures | Linked List | Question 16September 20, 2013

You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of… Read More »

## Data Structures | Linked List | Question 15August 27, 2013

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we… Read More »

## Data Structures | Queue | Question 11

Consider the following pseudo code. Assume that IntQueue is an integer queue. What does the function fun do? (A) Prints numbers from 0 to n-1… Read More »

## Data Structures | Linked List | Question 14August 23, 2013

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 13August 21, 2013

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 11August 19, 2013

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 10August 18, 2013

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 9May 28, 2013

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 »