Data Structure


A hash table is a data structure. It uses to store keys and values. The hash table does not allow to duplicate the keys. It allows to lookup the value based on the key.

Dictionary is the data structure that maps keys to values. Write a program to implement Dictionary.

Write a program to display partial search in the hash map. When the user type S, the string start with S display. Example Eclipse or Visual studio editor displays the list of methods from object

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

The ternary search tree is a trie. Each node arranged similarly to a binary search tree. It supports up to three children rather than the two children (binary trees limit of two).

Longest prefix match refers to an algorithm used by routers in Internet Protocol (IP) networking to select an entry from forwarding table.

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.