Spreadsheet Format
You can build Tree graphs from tree data structures. Here's a representation of a tree data structure:
Tree data structures are made of nodes, or elements on the tree. In the example above, each box represents a node.
Tree data structures are also hierarchical: each node (or element on the tree) has a parent node. In the example above, "Pet" is the parent of "Cat," "Dog," and "Rabbit". "Cat" is the parent of "Domestic Shorthair" and "Siamese."
Trees have a root node, which has no parent. "Pet" in the example above is the root node, since it has no parent.
You place nodes on the tree using two values: the name of the node, and the name of the node's parent. For example, you can place the Labrador node by knowing only "Labrador" (it's name) and "Dog" (it's parent). Remember, any node on the tree can be a parent.
A branch is a connection between two nodes. For example, there are two branches that extend from "Cat," and three that extend from "Pet."
Each row in the Tree spreadsheet represents a node on the tree.
| Column 1 | Column 2 | Column 3 | Column 4 | |
|---|---|---|---|---|
| Data Type | plain text | plain text | plain text | number |
| Contents | The word "node" Note:
| The name of the node's parent Note:
| The name of the node | The number of branches that extend from the node
|
For the sample tree above, the spreadsheet might look like this:
| Parent | Node | Branches | |
|---|---|---|---|
| node | root | Pet | 3 |
node | Pet | Cat | 2 |
| node | Pet | Dog | 3 |
| node | Pet | Rabbit | 0 |
| node | Cat | Domestic Shorthair | 0 |
| node | Cat | Siamese | 0 |
| node | Dog | Corgi | 0 |
| node | Dog | Great Dane | 0 |
| node | Dog | Labrador | 0 |