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…
Tag:
data structure tutorial
-
-
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…
-
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 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…
-
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 end 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…
-
Deletion in AVL Tree Deleting a node from an AVL tree is similar to that in a binary search tree. Deletion may…