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


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…

Redblack tree in Data Structure The redBlack tree is a binary search tree. The prerequisite of the redblack tree is that we…

Inorder traversal Steps Traverse the left subtree in inorder Visit the root Traverse the right subtree in inorder 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 subtree of the…

Preorder traversal Steps Visit the root node traverse the left subtree in preorder traverse the right subtree in preorder 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 subtree of a node A and the tree becomes…