Difference between revisions of "Tree"
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
A Tree in data structure is a [[Partially ordered set]]. From a programming viewpoint, all data types are some form of [[Tree]], and therefore, has been explicitly utilized to perform all possible programming tasks. However, due to various engineering tricks, program text has been organized in many ways, but it is necessary to note that they are all trees. More importantly, they should have have some kind of underlying [[Abstract syntax tree]]. | A Tree in data structure is a [[Partially ordered set]]. From a programming viewpoint, all data types are some form of [[Tree]], and therefore, has been explicitly utilized to perform all possible programming tasks. However, due to various engineering tricks, program text has been organized in many ways, but it is necessary to note that they are all trees. More importantly, they should have have some kind of underlying [[Abstract syntax tree]]. | ||
The interesting idea about [[Tree]], is that one can think of all its variations came from [[Lambda Calculus]]. In other words, all types of branching can be classified into just three kinds. | |||
=Example= | =Example= | ||
| Line 8: | Line 10: | ||
=References= | =References= | ||
<references/> | <references/> | ||
=Related Pages= | |||
[[Category:Poset]] | |||
Latest revision as of 05:52, 7 February 2022
A Tree in data structure is a Partially ordered set. From a programming viewpoint, all data types are some form of Tree, and therefore, has been explicitly utilized to perform all possible programming tasks. However, due to various engineering tricks, program text has been organized in many ways, but it is necessary to note that they are all trees. More importantly, they should have have some kind of underlying Abstract syntax tree.
The interesting idea about Tree, is that one can think of all its variations came from Lambda Calculus. In other words, all types of branching can be classified into just three kinds.
Example
The most relevant example of tree-based data representations are: XML, JSON, and YAML. These tree-based data representations have evolved for a long time, and they have been adopted broadly by many industrial applications.
The key idea is the all these data representations should be isomorphic and can find automatic translation between these data representation mechanisms[1]. More specifically, it is known that YAML can always be losslessly converted to JSON[2]. This means that we can find a well implemented software function, to perform translation reliably.