comb sort

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

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…

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…