7/26/2021 Data Structures | DS Tutorial - javatpoint

Data
Data Structures
Structures Index
Index

DS Basics Singly Linked List Programs

DS Tutorial Program to create and display a singly

DS Introduction linked list

DS Algorithm Program to create a singly linked list of n

Ds Asymptotic Analysis nodes and count the number of nodes

DS Pointer Program to create a singly linked list of n

nodes and display it in reverse order
DS Structure
Program to delete a new node from the
DS Array beginning of the singly linked list

Array Program to delete a new node from the

middle of the singly linked list
2D Array
Program to delete a node from the end of
DS Linked List the singly linked list

Linked List Program to determine whether a singly

linked list is the palindrome
Insertion at beginning
Program to find the maximum and
Insertion at end
minimum value node from a singly linked
Insertion after specified node
list
Deletion at beginning
Program to insert a new node at the
Deletion at end middle of the singly linked list
Deletion after specified node Program to insert a new node at the
Traversing beginning of the singly linked list
Searching Program to insert a new node at the end
Doubly Linked List of the singly linked list
Insertion at beginning Program to remove duplicate elements
Insertion at end from a singly linked list

Insertion after specified node Program to search an element in a singly

linked list
Deletion at beginning
Program to sort the elements of the singly
Deletion at end
linked list
Deletion of node having given data
Program to swap nodes in a singly linked
Traversing
list without swapping data
Searching
https://www.javatpoint.com/data-structure-tutorial 1/4
7/26/2021 Data Structures | DS Tutorial - javatpoint

Circular Linked List Program to swap the last element of the

Insertion at beginning singly linked list from the first one

Insertion at end Doubly Linked List Programs

Deletion at beginning
Program to Convert a Given Binary Tree to
Deletion at the end
Doubly Linked List
Traversing
Program to Create a Doubly Linked List
Searching
From a Ternary Tree
Circular Doubly List
Program to Create a Doubly Linked List of
Insertion at beginning N Nodes and Count the Number of
Insertion at end Nodes
Deletion at beginning Program to Create a Doubly Linked List of
Deletion at the end N Nodes and Display it in Reverse Order
Program to Create and Display a Doubly
DS Stack
Linked List
DS Stack Program to Delete a New Node From the
Array Implementation Beginning of the Doubly Linked List

Linked List Implementation Program to Delete a New Node From the

End of the Doubly Linked List
DS Queue
Program to Delete a New Node From the
DS Queue Middle of the Doubly Linked List
Array Implementation Program to Find the Maximum and
Linked List Implementation Minimum Value Node From a Doubly
Linked List
Circular Queue
Program to Insert a New Node at the
DS Tree Beginning of the Doubly Linked List

Tree Program to Insert a New Node at the End

of Doubly Linked List
Binary Tree
Program to Insert a New Node at the
Pre-order Traversal
Middle of Doubly Linked List
In-order Traversal
Program to Remove Duplicate Elements
Post-order Traversal
From a Doubly Linked List
Binary Search Tree
Program to Rotate Doubly Linked List by
Searching in BST N Nodes
Insertion in BST Program to Search an Element in a
Deletion in BST Doubly Linked List

https://www.javatpoint.com/data-structure-tutorial 2/4
7/26/2021 Data Structures | DS Tutorial - javatpoint

AVL Tree Program to Sort the Elements of the

Insertion in AVL Tree Doubly Linked List

LL Rotation Circular Linked List Programs

LR Rotation
Program to Create a Circular Linked List of
RL Rotation
N Nodes and Count the Number of
RR Rotation Nodes
Deletion in AVL Tree Program to Create a Circular Linked List of
B Tree N Nodes and Display it in Reverse Order
B+ Tree Program to Create and Display a Circular
Red Black Tree Linked List
Program to Delete a New Node From the
DS Graph
Beginning of the Circular Linked List
DS Graph Program to Delete a New Node From the
Graph Implementation End of the Circular Linked List
BFS Algorithm Program to Delete a New Node From the
DFS Algorithm Middle of the Circular Linked List
Spanning Tree Program to Find the Maximum and

Prim's Algorithm Minimum Value Node From a Circular

Linked List
Kruskal's Algorithm
Program to Insert a New Node at the
DS Searching Beginning of the Circular Linked List

Linear Search Program to Insert a New Node at the End

of the Circular Linked List
Binary Search
Program to Insert a New Node at the
DS Sorting Middle of the Circular Linked List

Bubble Sort Program to Remove Duplicate Elements

From a Circular Linked List
Bucket Sort
Program to Search an Element in a
Comb Sort
Circular Linked List
Counting Sort
Program to Sort the Elements of the
Heap Sort
Circular Linked List
Insertion Sort
Merge Sort Tree Programs

Quick Sort Program to Calculate the Difference

Radix Sort Between the Sum of the Odd Level and
Even Level Nodes of a Binary Tree
https://www.javatpoint.com/data-structure-tutorial 3/4
7/26/2021 Data Structures | DS Tutorial - javatpoint

Selection Sort Program to Construct a Binary Search

Shell Sort Tree and Perform Deletion and Inorder

Bitonic Sort Traversal

Cocktail Sort Program to Convert Binary Tree to Binary

Search Tree
Cycle Sort
Program to Determine Whether all Leaves
Tim Sort
are at Same Level
Interview Questions Program to Determine Whether two Trees
are Identical
DS Interview Questions
Program to Find Maximum Width of a
Binary Tree
Program to Find the Largest Element in a
Binary Tree
Program to Find the Maximum Depth or
Height of a Tree
Program to Find the Nodes Which are at
the Maximum Distance in a Binary Tree
Program to Find the Smallest Element in a
Binary Tree
Program to Find the Sum of all the Nodes
of a Binary Tree
Program to Find the Total Number of
Possible Binary Search Trees with N Keys
Program to Implement Binary Tree using
the Linked List
Program to Search a Node in a Binary
Tree

https://www.javatpoint.com/data-structure-tutorial 4/4