This is a C Program for Spiral Order Traversal of a Tree using Recursion. Problem Description In this program we are going to create a tree, and we will traverse it in a spiral order. Spiral Traversal basically means first traversing the nodes in a tree left to right then right to left or vice … Read more
This is a C Program for Level Order Traversal of a Tree using Recursion. Problem Description Here in this problem we will be traversing the nodes of tree from left to right level by level. First the nodes at level 1 will be printed followed by the level two and so on. This problem is … Read more
This is a C Program to Implement Hash Tables Chaining with Doubly Linked Lists. Problem Description A hash table is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots. … Read more
This is a C Program to Implement Hash Tables Chaining with Binary Trees. Problem Description A hash table is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots. This … Read more
This is a C Program to Implement Hash Tables with Linear Probing. Problem Description A hash table is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots. Due to … Read more
This is a C program to Implement Hash Tables with Quadratic Probing. Problem Description A hash table is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots. Quadratic Probing … Read more
This is a C Program to Implement a Hash Table using Singly Linked List. Problem Description A hash table is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots. … Read more
This is a C Program to implement Adjacency List. An array of linked lists is used. Size of the array is equal to number of vertices. Let the array be array[]. An entry array[i] represents the linked list of vertices adjacent to the ith vertex. This representation can also be used to represent a weighted … Read more
This is a C Program to implement XOR list. An XOR linked list is a data structure used in computer programming. It takes advantage of the bitwise XOR operation to decrease storage requirements for doubly linked lists. Here is source code of the C Program to Implement Xor Linked List. The C program is successfully … Read more
This is a C Program to implement Vectors. An array (vector) is a common-place data type, used to hold and describe a collection of elements. These elements can be fetched at runtime by one or more indices (identifying keys). A distinguishing feature of an array compared to a list is that they allow for constant-time … Read more
