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


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 of the last node in a doubly linked list needs traversing the list…

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 the specified node : In order to delete the node, which is present after the specified…

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 Deleting a node from the beginning of the list is the simplest operation of all.…

LR Rotation LR rotation is to be performed if the new node is inserted into the right of the left subtree of…

Deletion in singly linked list at the end There are two scenarios in which, a node is deleted from the end of…

Prim’s Algorithm In this article, we will discuss the prim’s algorithm. Along with the algorithm, we will also see the complexity, working,…