all the key values cannot be easily represented as strings for examplethe same floating point number can be represented as string in multiple ways ( is equivalent to + etc applications tries are commonly used to store dictionary (for exampleon mobile telephonethese applications take advantage of trie' ability to quickly searchinsertand delete the entries tries are also used to implement approximate matching algorithmsincluding those used in spell-checking software points to remember an -way search tree has values per node and sub-trees in such treem is called the degree of the tree -way search tree consists of pointers to sub-trees and contains keyswhere tree of order can have maximum of - keys and pointers to its sub-trees tree may contain large number of key values and pointers to its sub-trees btree is variant of tree which stores sorted data in way that allows for efficient insertionretrievaland removal of recordseach of which is identified by key btree record data at the leaf level of the treeonly keys are stored in interior nodes trie is an ordered tree data structure which stores keys that are usually strings it is basically -ary position tree in contrast to binary search treesnodes in trie do not store the keys associated with them rathera node' position in the tree represents the key associated with that node in - treeeach interior node has either two or three children this means that - tree is not binary tree exercises review questions why is large value of needed in tree compare trees with btrees in what conditions will you prefer btree over tree write short note on trie data structure compare binary search trees with trie alsolist the merits and demerits of using the trie data structure compare hash tables with trie give brief summary of -way search trees consider the tree given below (ainsert and in the tree (bdelete and from the tree write an essay on btrees create btree of order for the following data arriving in sequence ( tree for list down the applications of trees trees of order are full binary trees justify this statement consider the -way search tree given below insert and in the tree thendelete and from it