Difference between revisions of "Tree"
Jump to navigation
Jump to search
(Created page with "A Tree in data structure is a Partially ordered set.") |
|||
| Line 1: | Line 1: | ||
A Tree in data structure is a [[Partially ordered set]]. | 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]]. | ||
=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. | |||
Revision as of 14:27, 18 January 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.
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.