Searching Searching means finding or locating some specific element or node within a data structure. However, searching for some specific node in…
Data Structures Tutorial
-
-
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…
-
Insertion in singly linked list after specified Node In order to insert an element after the specified number of nodes into the…
-
Searching for a specific node in Doubly Linked List We just need traverse the list in order to search for a specific…
-
Searching in singly linked list Searching is performed in order to find the location of a particular element in the list. Searching…
-
Traversing in Circular Singly linked list Traversing in circular singly linked list can be done through a loop. Initialize the temporary pointer…
-
Traversing in doubly linked list Traversing is the most common operation in case of each data structure. For this purpose, copy the…
-
Traversing in singly linked list Traversing is the most common operation that is performed in almost every scenario of singly linked list.…
-
Searching in circular singly linked list Searching in circular singly linked list needs traversing across the list. The item which is to…