Home Â» B.Tech / MCA Â» Data Structures Tutorial
Category:

# Data Structures Tutorial

• ## Deletion in Circular Singly Linked List at End

Deletion in Circular singly linked list at the end There are three scenarios of deleting a node in circular singly linked list…

• ## Deletion in Doubly Linked List After The Specified Node

Deletion in doubly linked list after the specified node In order to delete the node after the specified data, we need to…

• ## Insertion in Singly Linked List at Beginning

Insertion in singly linked list at beginning Inserting a new element into a singly linked list at beginning is quite simple. We…

• ## Deletion in Doubly Linked List at Beginning

Deletion at beginning Deletion in doubly linked list at the beginning is the simplest operation. We just need to copy the head…

• ## Insertion in Singly Linked List at End

Insertion in singly linked list at the end In order to insert a node at the last, there are two following scenarios…

• ## Deletion in Doubly Linked List at The End

Deletion in doubly linked list at the end Deletion of the last node in a doubly linked list needs traversing the list…

• ## Kruskal’s Algorithm

Kruskal’s Algorithm In this article, we will discuss Kruskal’s algorithm. Here, we will also see the complexity, working, example, and implementation of…

• ## Deletion in Singly Linked List After Specified Node

Deletion in singly linked list after the specified node : In order to delete the node, which is present after the specified…

• ## LL Rotation in AVL Tree

LL Rotation The tree shown in following figure is an AVL Tree, however, we,need to insert an element into the left of…

• ## Deletion in Singly Linked List at Beginning

Deletion in singly linked list at beginning Deleting a node from the beginning of the list is the simplest operation of all.…