You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 9 Next »

Spreadsheet Format

You can build organization charts from tree data structures. Here's a representation of a tree data structure: 

Example of 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.  This is the only relationship that matters when you're building your spreadsheet. For example, you can place the Labrador node with "Labrador" (it's name) and "Dog" (it's parent). Remember, any node on the tree can be a parent. 

Each row in the Organization Chart spreadsheet represents a node on the tree. 

 

 Column 1Column 2
Data Typeplain textplain text
Contents

The name of the node. Each node must have a unique name.

The name of the node's parent.

Note:

  • If this is the first node on the tree (called the root), leave the cell blank
  • Keep node names consistent across the spreadsheet

 

For the sample tree above, the spreadsheet might look like this: 

NodeParent
Pet 
CatPet
DogPet
RabbitPet
Domestic ShorthairCat
SiameseCat
CorgiDog
Great DaneDog
LabradorDog
  • No labels