## Data Structures | Binary Search Trees | Question 12

Consider the following Binary Search Tree 10 / \ 5 20 / / \ 4 15 30 / 11 If we randomly search one of… Read More »

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

Which of the following is true about AVL and Red Black Trees? (A) In AVL tree insert() operation, we first traverse from root to newly… Read More »

## Data Structures | Binary Search Trees | Question 8

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… Read More »

## Data Structures | Queue | Question 10

Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is… Read More »

## Data Structures | Graph | Question 8

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the… Read More »

## Data Structures | Graph | Question 9

Which of the following statements is/are TRUE for an undirected graph? P: Number of odd degree vertices is even Q: Sum of degrees of all… Read More »

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

Which of the following is true about Red Black Trees? (A) The path from the root to the furthest leaf is no more than twice… Read More »

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

Which of the following is true (A) The AVL trees are more balanced compared to Red Black Trees, but they may cause more rotations during… Read More »

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

Consider the following left-rotate and right-rotate functions commonly used in self-adjusting BSTs T1, T2 and T3 are subtrees of the tree rooted with y (on… Read More »

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

Which of the following is a self-adjusting or self-balancing Binary Search Tree (A) Splay Tree (B) AVL Tree (C) Red Black Tree (D) All of… Read More »

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

Consider the following AVL tree. 60 / \ 20 100 / \ 80 120 Which of the following is updated AVL tree after insertion of… Read More »

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

Which of the following is AVL Tree? A 100 / \ 50 200 / \ 10 300 B 100 / \ 50 200 / /… Read More »

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

What is the worst case possible height of AVL tree? (A) 2Logn Assume base of log is 2 (B) 1.44log n Assume base of log… Read More »

## Data Structures | Array | Question 2

Which of the following operations is not O(1) for an array of sorted data. You may assume that array elements are distinct. (A) Find the… Read More »

## Data Structures | Tree Traversals | Question 12

The array representation of a complete binary tree contains the data in sorted order. Which traversal of the tree will produce the data in sorted… Read More »