If you want a tree, why don't you use a real tree structure?

Tree::DAG_Node is meant for cases like this one.

#!/usr/bin/perl -w
use strict;
use Tree::DAG_Node;

my $org = Tree::DAG_Node->new;          # the root
$org->name('Office of President');      # name it
$org->new_daughter->name('Recruiting'); # first dept
my $sw = Tree::DAG_Node->new;           # new dept
$org->add_daughter($sw);                # add to root
$sw->name('Software');                  # name it
$sw->new_daughter->name('MIS');         # add sub-depts
$sw->new_daughter->name('System Operations');
$org->new_daughter->name('Pipe line');  # one more dept

print map "$_\n", @{$org->draw_ascii_tree},"\n";

print $org->dump_names;

__END__
output:

                        |
              <Office of President>
     /-------------------+------------------\
     |                   |                  |
<Recruiting>        <Software>         <Pipe line>
               /------------\
               |            |
             <MIS> <System Operations>


'Office of President'
  'Recruiting'
  'Software'
    'MIS'
    'System Operations'
  'Pipe line'
[download]

You can also build a tree on the fly, from an existing list of lists. Notice that in this case the root is at the bottom (as in botanical trees ;-) )

my $tree =
  [
    [ 'Recruiting' ],
    [ 
      [ 'MIS' ], [ 'System Operations' ], 
      'Software'  
    ],
    [ 'Pipe line' ],
    'Office of President'
  ];

my $org = Tree::DAG_Node->lol_to_tree($tree);
[download]

For more examples, see Introduction to Tree::DAG_Node in Tutorials.

Update Added code comments.

 _  _ _  _  
(_|| | |(_|><
 _|