A priority queue is a data structure and each element has a priority associated with it. The high priority served before with low priority. The priority queue key will be unique. The priority queue can be implemented using Unordered linked list, ordered linked list, Ordered array, and balanced Binary search tree.
B-tree is a tree data structure that keeps data sorted and support search, sequential access, insertions, and deletions in logarithmic time. If the data is not able to store in main memory, it store in the secondary memory.
The red-black tree is a binary search tree with color information. The color can be either red or black and it helps to balance the tree. The red-black tree has a complex implementation. The red-black binary search tree is an efficient data structure for maintaining the balanced binary search.
Write a program to convert an integer to the string.
Edit distance is a way of quantifying how dissimilar two strings are to one another by counting the minimum number of operations required to transform one string into the other.
Write a program to implement strstr using array.
Write a program to sort the two sorted array of numbers using merge sort.
Write a program converts from string to integer.
Write a program to give three sums from the array.
Given an array of elements and sum. The program should displays the array elements which combinations equal to sum.Write a program to give two sums from the array.