)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.
Because nothing says "I Love You" Like an open source app. Read More »Guarding your Data against Cyber Attacks
In this new era of heightened stakes comes an increased need for a comprehensive security strategy. Let's take a look at how cyber-threats have... Read More »The Great Data Storage Debate: Is Tape Dead?
Tape clearly is on the decline. But remember, legacy systems can hang for a shockingly long time. Read More »
A network is a group of two or more computer systems or devices, linked together to share resources, exchange files and electronic communications.... Read More »Computer Architecture Study Guide
This Webopedia study guide describes the different parts of a computer system and their relations. Read More »Webopedia Polls
The trend for the past two years has been for shoppers to spend more online during the holiday season. How do you typically shop for holiday... Read More »
Stay up to date on the latest developments in Internet terminology with a free weekly newsletter from Webopedia. Join to subscribe now.
- Watch Datamation's editor James Maguire moderate roundtable discussions with tech experts from companies such as Accenture, Dell, Blue Jeans Network, Microsoft and more »