## Data Structures | Linked List | Question 17

Consider the following function to traverse a linked list. filter_none edit close play_arrow link brightness_4 code void traverse(struct Node *head) { while (head->next != NULL)… 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

Consider the following function to traverse a linked list. filter_none edit close play_arrow link brightness_4 code void traverse(struct Node *head) { while (head->next != NULL)… Read More »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »