This work is licensed under the Creative Commons Attribution-ShareAlike License. To view a copy of this license, visit http://creativecommons.org/licenses/by-sa/2.0/ or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA.
*********************************************************************
Data structure (mxt-configurator)
-------------------------------------------------------------------------------
Authors :
    - Nicolas Dufresne, Yves Trudeau, Benoit des Ligneris

Logs:
    2004-07-08 Nicolas Dufresne <nicolas@revolutionlinux.com>
	- Second pass
	- Change to reflect tree flexibility
	
    2004-07-08 Nicolas Dufresne <nicolas@revolutionlinux.com>
    - Creation
-------------------------------------------------------------------------------

Hierarchic schema:
 _________
|   SD    |
|_________|   __________
     |_______|  School1 |
     |       |__________|    _________
     |             |________|   Room  |
     |             |        |_________|    __________
     |             |              |_______| Computer |
     |             |        __________    |__________|
     |             |_______| Computer |
     |        __________   |__________|
     |_______| Computer |
             |__________|
						   

The structure is a customizable tree.  The is compose of nodes and leaves.
Nodes are generaly representing a group like a school district (SD) or a room.
Leaves are computers.  For data structure there is not difference between a
node and a leaf.  The only thing that defferentiate both is the rule applied to
them. As exemple, a leaf cannot have children.  To get complete configuration
for a leaf, you need to read a complet branch. As you can define any attributes to any nodes or leaf (except for mac address), you query the branch treating 
the farest element as most important.
