Tree Structure

tree structure

)A type of data structure in which each element is attached to one or more elements directly beneath it. The connections between elements are called branches. Trees are often called inverted trees because they are normally drawn with the root at the top.

The elements at the very bottom of an inverted tree (that is, those that have no elements below them) are called leaves. Inverted trees are the data structures used to represent hierarchical file structures. In this case, the leaves are files and the other elements above the leaves are directories.

A binary tree is a special type of inverted tree in which each element has only two branches below it.

Webopedia Staff
Webopedia Staff
Since 1995, more than 100 tech experts and researchers have kept Webopedia’s definitions, articles, and study guides up to date. For more information on current editorial staff, please visit our About page.

Related Articles

ScalaHosting

ScalaHosting is a leading managed hosting provider that offers secure, scalable, and affordable cloud VPS solutions for businesses. It claims to change the status...

Data Lake

A data lake is a storage space for all forms of data in an organization, whether raw or processed, structured or unstructured.

Resume

A resume is a formal document created and used by a person to show their career background and skills. Resumes are used for a...

Web Hosting

Web hosting makes a web server available to businesses with varying degrees of provider management. Customers host their websites on the internet through the...

ScalaHosting

ScalaHosting is a leading managed hosting provider that offers secure, scalable, and affordable...

HRIS

Human resources information system (HRIS) solutions help businesses manage multiple facets of their...

Best Managed Service Providers...

In today's business world, managed services are more critical than ever. They can...