Home Â» B.Tech / MCA Â» Data Structures Tutorial
Category:

# Data Structures Tutorial

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

• ## Insertion in Circular Doubly Linked List at End

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

• ## Searching in Binary Search Tree

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

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

• ## Insertion in Circular Singly Linked List at End

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