## 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 »

- Sum of all Palindrome Numbers present in a Linked list
- Program to print all the non-reachable nodes | Using BFS
- Least Common Ancestor of any number of nodes in Binary Tree
- Minimum Spanning Tree using Priority Queue and Array List
- Minimum cost to merge numbers from 1 to N
- Encryption and Decryption of String according to given technique
- Program to delete all even nodes from a Singly Linked List
- Program to create Custom Vector Class in C++
- Sideways traversal of a Complete Binary Tree
- Binary Search Tree | Set 3 (Iterative Delete)
- Find all Factors of Large Perfect Square Natural Number in O(sqrt(sqrt(N))
- Maximum of XOR of first and second maximum of all subarrays
- C program to implement Adjacency Matrix of a given Graph
- Sum of all perfect numbers present in an Linked list
- Count of strings possible by replacing two consecutive same character with new character
- Print the nodes having exactly one child in a Binary tree
- Check if alternate path exists from U to V with smaller individual weight in a given Graph
- Count of triplets in an Array (i, j, k) such that i < j < k and a[k] < a[i] < a[j]
- Shortest path in a complement graph
- Comparison between Lists and Array in Python

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 »

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 »

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 »

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 »

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 »

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

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »