A common data structure consisting of a set of nodesbasic units of datalinked 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.