Question

applications of tree

Answer 1

hope this answer helps y

Answer 2

The simplest answer is access pattern. A tree, in DAG form, has some interesting properties that make it ideal for certain kinds of data collection and access. For example, in the binary form, if the data stored has a consistent greater/less relationship that can be determined, then any piece of data can be reached using that relationship in a relatively efficient manner. This presupposes that the tree is generated in a balanced fashion, and the more balanced, the closer to log of the number of elements in the tree will be the amount of time. Compare this to a list where you would have to iterate through some fraction of the list to find the piece of data. Binary search, for that same list, is similar access time, but there’s some advantage to having the structure already because it simplifies the algorithms required to search it or collect other kinds of information about it, like how many leaves at level x. And this is usually the case with data structures, that the point of the structure is to give us some advantage either in storage, access or processing time.

Another good answer would be for representation and compression, see Huffman coding - Wikipedia for an early example.

B-trees have been used historically for storing and accessing large portions of data, see B-tree - Wikipedia.

Also, trees can be representative of many kinds of possibility spaces, search spaces, and thus many algorithms have been developed to quickly create, search through, and dissect these trees.