## Data Structures | Linked List | Question 7

The following C function takes a simply-linked list as input argument. It modifies the list by moving the last element to the front of the… 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

The following C function takes a simply-linked list as input argument. It modifies the list by moving the last element to the front of the… Read More »

The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the… Read More »

We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the… Read More »

A max-heap is a heap where the value of each parent is greater than or equal to the values of its children. Which of the… Read More »

Consider two binary operators ‘ ‘ and ‘‘ with the precedence of operator being lower than that of the operator. Operator is right associative while… Read More »

The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is (A) (B) (C)… Read More »

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation… Read More »

Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph? (A) In adjacency list representation, space is… Read More »

Which of the following is true about linked list implementation of queue? (A) In push operation, if new nodes are inserted at the beginning of… Read More »

Which of the following is true about linked list implementation of stack? (A) In push operation, if new nodes are inserted at the beginning of… Read More »

A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the… Read More »

What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6 filter_none edit close play_arrow link brightness_4 code… Read More »

Which of the following pairs of traversals is not sufficient to build a binary tree from the given traversals? (A) Preorder and Inorder (B) Preorder… Read More »

In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right… Read More »

What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree? (A) O(n) for all (B) O(Logn)… Read More »