Tree Data Structure

tree data structure - [data structures] A common data structure consisting of a set of nodes"”basic units of data"”linked hierarchically. Each node can contain one or more subordinate nodes within it, in which case it is called a parent node. The subordinate nodes are called child nodes. A node without a parent node is the root node; a node without one or more child nodes is called a leaf node. A tree data structure is used to manipulate hierarchical data and make it easily searchable.

[Category=Geospatial ]

Source: esri, 17 September 2012 09:55:38, http://support.esri.com/en/knowledgebase/GISDictionary/term/abbreviation