Data structure


A hash array based trie is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie. Write program to implement the hash map based trie

Trie or prefix tree is an ordered tree data structure that allows strings with similar chars to prefix to use the same prefix data and only the remaining stored in separate data. A trie is data structure uses for storing the strings in which there is one node for every common prefix. Trie word comes from retrieval.

A word ladder puzzle begins with two words and to solve the puzzle one must find a chain of other words to link the two, in which two adjacent words differ by one letter.

The set is a data structure that can store values without any order and do not contain duplicate elements. The set is a computer implementation of a finite set. It contains finite natural number of elements. The subset is a set build from master set and has few elements. Example, Set S={1, 2, 3, 4, 5}, Subset = { {1, 2, 3}, {2, 3}, {1}}. The set can be implemented using linked lists, vectors and hash tables.

Heap sort is a comparison-based sorting algorithm. It divides the input into a sorted and an unsorted region. It iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region.