Home Â» structure
Tag:

structure

• Deletion in Singly Linked List at End

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

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 in AVL Tree

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

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 in Binary Search Tree

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

• RL Rotation in AVL Tree

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

• Binary Tree Inorder Traversal

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

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

• RR Rotation in AVL Tree

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

• Binary Tree Preorder Traversal

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