RL Rotation RL rotations is to be performed if the new node is inserted into the left of right subtree of the…
shell sort


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

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

Inorder traversal Steps Traverse the left subtree in inorder Visit the root Traverse the right subtree in inorder Algorithm Step 1: Repeat…

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

Searching Searching means finding or locating some specific element or node within a data structure. However, searching for some specific node in…

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 end There are two scenario of inserting a node in circular doubly linked list at…

Deletion in AVL Tree Deleting a node from an AVL tree is similar to that in a binary search tree. Deletion may…

Insertion into circular singly linked list at the end There are two scenario in which a node can be inserted in circular…