Tree data structure real world examples

What is tree data structure?

A tree is a hierarchical data structure that consists of nodes connected by edges. It is NOT a linear data structure.

Examples of Tree data structure

The tree data structure is widely used in many areas of computer science. The following are some examples of tree data structure:

The heavyly used XML/HTML parsers use tree data structure. Apache Xerces, Xalan XSLT parser etc.
PDF is a tree based format. It has a root node followed by a catalog node followed by a pages node which has several child page nodes.
Computer chess games use tree data structure to reach an optimal move.
Producers/consumers often use a balanced tree implementation to store a document in memory.
Producers/consumers often use a balanced tree implementation to store a document in memory.
Social networking app often uses tree data structure to represent/identify more interesting criteria. Example: common friends
Decision Tree based Learning actually forms a formidable area of data mining research.
A common problem in bioinformatics is searching huge databases to find matches for a given query string. Tree can be used for efficient searching.
Quite a few successful (stock) traders use decision trees in their day-to-day trading