Prakash Kumar

In hashing technique, Collison is a situation when hash value of two key become similar. Suppose we want to add a new Record with key k in a hashtable, but index address H(k) is already occupied by another record. This situation is known as a collision. Example to understand the Collision Situation In the below … Read more

A binary search tree is one of the variants of the binary tree, also known as an ordered binary tree, in which the nodes are arranged in order by some rule mentioned below. Node of binary search tree follows order mentioned below The value of all nodes in the left sub-tree or left child should … Read more

Binary search is a very efficient searching technique for finding an element from a sorted Array. This technique follows the divide and conquers approach to perform a searching operation. Suppose we have 10,000 sorted elements in an array and want to search a value in that array. If we follow linear searching, then in the … Read more

A linear search or sequential search is a searching method to check a desired element or data in a given Array in computer science. In linear searching technique, each element of an Array is compared with the value for which we perform the search operation. If matches are found, it will return the array index … Read more

C Program to Reverse a Linked List Output:

Deleting a node in linked list From Beginning Output: Deleting a node in linked list From End Output: Delete node at given position in a linked list Output:

C Program for Search in Linked List Output:

C Program to insert node at end/tailof linked list

linked list insertion program in C at beginning Output: