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

# Data Structures Tutorial

• ## Deletion in Binary Search Tree

Deletion Delete function is used to delete the specified node from a binary search tree. However, we must delete a node from…

• ## Insertion in Circular Singly Linked List at Beginning

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

• ## Deletion in Circular Doubly Linked List at Beginning

Deletion in Circular doubly linked list at beginning There can be two scenario of deleting the first node in a circular doubly…

• ## Insertion in Doubly Linked List After Specified Node

Insertion in doubly linked list after Specified node In order to insert a node after the specified node in the list, we…

• ## Deletion in Circular Doubly Linked List at End

Deletion in circular doubly linked list at end There can be two scenario of deleting the first node in a circular doubly…

• ## Insertion in Doubly Linked List at Beginning

Insertion in doubly linked list at beginning As in doubly linked list, each node of the list contain double pointers therefore we…

• ## Deletion in Circular Singly Linked List at Beginning

Deletion in circular singly linked list at beginning In order to delete a node in circular singly linked list, we need to…

• ## Insertion in Doubly Linked List at The End

Insertion in doubly linked list at the end In order to insert a node in doubly linked list at the end, we…

• ## Deletion in Circular Singly Linked List at End

Deletion in Circular singly linked list at the end There are three scenarios of deleting a node in circular singly linked list…

• ## Deletion in Doubly Linked List After The Specified Node

Deletion in doubly linked list after the specified node In order to delete the node after the specified data, we need to…