Data Structures

800+ posts

Similar Topics

DSA

20.8k+ articles

Mathematical

7.6k+ articles

Arrays

6.4k+ articles

Competitive Programming

1.4k+ articles

Tree

1.3k+ articles

Algorithms

1.2k+ articles

Linked List

1k+ articles

Graph

840+ articles

Binary Tree

330+ articles

Data Structures

220+ articles

Searching in Binary Search Tree (BST)

Last Updated: 28 July 2023

Given a BST, the task is to delete a node in this BST.For searching a value in BST, consider it as a sorted array. Now we can easily perform search operation in BST using ...read more

Heap Sort - Data Structures and Algorithms Tutorials

Last Updated: 25 July 2023

Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and plac...read more

Insertion in Linked List

Last Updated: 07 June 2023

Given a Linked List, the task is to insert a new node in this given Linked List at the following positions:At the front of the linked listAfter a given node.At the end of ...read more

Understanding the basics of Linked List

Last Updated: 07 June 2023

Linked List is a linear data structure, in which elements are not stored at a contiguous location, rather they are linked using pointers. Linked List forms a series of con...read more

Linked List

Python-Data-Structures

DSA

How to find Shortest Paths from Source to all Vertices using Dijkstra's Algorithm

Last Updated: 22 June 2023

Given a graph and a source vertex in the graph, find the shortest paths from the source to all vertices in the given graph.Examples:Input: src = 0, the graph is shown belo...read more

Vizury Interactive Solutions

Greedy

Shortest Path

DSA

Breadth First Search or BFS for a Graph

Last Updated: 09 June 2023

The Breadth First Search (BFS) algorithm is used to search a graph data structure for a node that meets a set of criteria. It starts at the root of the graph and visits al...read more

Depth First Search or DFS for a Graph

Last Updated: 09 June 2023

Depth First Traversal (or DFS) for a graph is similar to Depth First Traversal of a tree. The only catch here is, that, unlike trees, graphs may contain cycles (a node may...read more

Program for array left rotation by d positions.

Last Updated: 06 October 2023

Given an array of integers arr[] of size N and an integer, the task is to rotate the array elements to the left by d positions.Examples: Input:arr[] = {1, 2, 3, 4, 5, 6, 7...read more

Write a program to reverse an array or string

Last Updated: 06 October 2023

Given an array (or string), the task is to reverse the array/string.Examples :Input : arr[] = {1, 2, 3}Output : arr[] = {3, 2, 1}Input : arr[] = {4, 5, 1, 2}Output : arr...read more

Reverse a Linked List

Last Updated: 21 November 2022

Given a pointer to the head node of a linked list, the task is to reverse the linked list. We need to reverse the list by changing the links between nodes.Examples:Input: ...read more

Tree Traversal Techniques - Data Structure and Algorithm Tutorials

Last Updated: 23 June 2023

Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways.A Tree D...read more

Largest Sum Contiguous Subarray (Kadane's Algorithm)

Last Updated: 30 October 2023

Given an array arr[] of size N. The task is to find the sum of the contiguous subarray within a arr[] with the largest sum.Recommended PracticeSave Your LifeTry It!The ide...read more

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>