Tutorials
Go Premium

Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Sorting1.1K+ articles

Searching1.0K+ articles

Binary Search530+ articles

two-pointer-algorithm213+ articles

Analysis of Algorithms187+ articles

Ternary Search12+ articles

Linear Search6+ articles

Competitive Programming-QnA3+ articles

Data Structures and Algorithms-QnA

44 posts

Time and Space Complexity of DFS and BFS Algorithm

Last Updated: 28 March 2024

The time complexity of both Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms is O(V + E), where V is the number of vertices and E is the number of edges ...read more

Analysis of Algorithms

Data Structures and Algorithms-QnA

What are real life examples of Double Linked List?

Last Updated: 18 March 2024

A real-life example of a doubly linked list is a web browser where each website you visit (node) can be navigated forward or backward to using the browser’s forward and ba...read more

article_image

Data Structures and Algorithms-QnA

Why do we need circular linked lists?

Last Updated: 18 March 2024

Circular linked lists are particularly useful in applications where we need to cycle through data repeatedly. They are efficient for certain types of problems and can be u...read more

article_image

Data Structures and Algorithms-QnA

Which is better linked list or array?

Last Updated: 18 March 2024

Linked lists and arrays have their own strengths and weaknesses. The choice between them depends on the specific requirements of the task at hand. Arrays are better when y...read more

Data Structures and Algorithms-QnA

Why use a Doubly Linked List?

Last Updated: 18 March 2024

A doubly linked list is a type of data structure that allows for efficient insertion and deletion of elements at both ends. It is beneficial in scenarios where you need to...read more

article_image

Data Structures and Algorithms-QnA

Is two way linked list and doubly linked list same?

Last Updated: 18 March 2024

Yes, a two-way linked list and a doubly linked list are the same. Both terms refer to a type of linked list where each node contains a reference to the next node as well a...read more

article_image

Data Structures and Algorithms-QnA

How to create linked list?

Last Updated: 30 May 2024

In this article, we will explore the process of creating a linked list. A linked list consists of nodes, each containing data and a reference to the next node. We will wal...read more

article_image

Data Structures and Algorithms-QnA

What is Two Way Header Linked List?

Last Updated: 01 April 2024

Two-Way Header Linked List, also known as a doubly linked list with a header node, is a type of linked list that contains a special node at the beginning called the header...read more

Data Structures and Algorithms-QnA

Why do we use branch and bound algorithm?

Last Updated: 19 March 2024

The Branch and Bound algorithm is used to solve optimization problems where the goal is to find the best solution out of all possible solutions. It is efficient as it elim...read more

Branch and Bound

Data Structures and Algorithms-QnA

Which strategy can be used to solve branch and bound problem?

Last Updated: 05 April 2024

Branch and Bound problem can be solved using different strategies such as Least Cost (LC) Search, Breadth-First Search (BFS) and Depth-First Search (DFS). These strategies...read more

Branch and Bound

Data Structures and Algorithms-QnA

Two-Pointer Technique in a Linked List

Last Updated: 04 March 2024

The two-pointer technique is a common technique used in linked list problems to solve a variety of problems efficiently. It involves using two pointers that traverse the l...read more

two-pointer-algorithm

Data Structures and Algorithms-QnA

Is ternary search faster than binary search?

Last Updated: 15 February 2024

Binary search is a widely used algorithm for searching a sorted array. It works by repeatedly dividing the search space in half until the target element is found. Ternary ...read more

Data Structures and Algorithms-QnA

Why use Ternary search tree (TST)?

Last Updated: 14 March 2024

Ternary search tree (TST) is a very popular data structure used in the problem solving becaus of following reasons: First, they offer efficient search operations, particul...read more

Data Structures and Algorithms-QnA

Ternary Search Tree

In which situation we can use ternary search?

Last Updated: 19 February 2024

Ternary search is a divide-and-conquer search algorithm that works on sorted arrays. It is similar to binary search, but it divides the array into three parts instead of t...read more

Analysis of Algorithms

Data Structures and Algorithms-QnA

In what situation can we use binary search?

Last Updated: 19 February 2024

Binary search is a powerful algorithm that can be used to find a target value within a sorted array. It works by repeatedly dividing the array in half until the target val...read more

Data Structures and Algorithms-QnA