merge sort

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,…

Insertion Insertion in AVL tree is performed in the same way as it is performed in a binary search tree. The new…

Red-black tree in Data Structure The red-Black tree is a binary search tree. The prerequisite of the red-black tree is that we…

In-order traversal Steps Traverse the left sub-tree in in-order Visit the root Traverse the right sub-tree in in-order Algorithm Step 1: Repeat…

Insertion Insert function is used to add a new element in a binary search tree at appropriate location. Insert function is to…

RL Rotation RL rotations is to be performed if the new node is inserted into the left of right sub-tree of the…

Pre-order traversal Steps Visit the root node traverse the left sub-tree in pre-order traverse the right sub-tree in pre-order Algorithm Step 1:…

Insertion in circular doubly linked list at beginning There are two scenario of inserting a node in circular doubly linked list at…

RR Rotation If the node is inserted into the right of the right sub-tree of a node A and the tree becomes…