Anonymous Monk, that's a nice code you wrote ;-).

As I looked at it, though, I couldn't help but 
hack it a bit here and there.  My hope was to shorten
it up a bit (which, who knows, may lead to some
performance improvements? ;).  So, if you like the
change just stick to it... I'd be glad to know that
it was useful to you. 

Anyhow, here we go:
sub do_tree {
# --------------------------------------------------------
# this is the tree loop that call itself to display records in 
# tree form.  pass it some record ids and see what happens!

  my %rec = &get_record ($_[0]);
  # get all the kids; weed out empty ones
  my @children = sort grep( {length} , split (/ /, $rec{'Children'}));
+ 

  # no kids?  actually display the record then
  print "<li>[$rec{'ID'}] $rec{'Subject'}</li>\n" unless ($#children);

  # kinds actually exist? display them...
  print "<li>[$rec{'ID'}] $rec{'Subject'}<ul>\n";
  do_tree($child) for my $child (@children);
  print "</ul></li>\n";
}
[download]


ps. i didn't test it or anything... however, i feel
like it should work without much hassle on your part.

print join(" ", map { sprintf "%#02x", $_ }unpack("C*",pack("L",0x1234
+5678)))
[download]