Here is a technique I use in one of my module tests for removing the directory 'test' and anything below:

find( {
    bydepth => 1,
    wanted => sub { if (-d $_) {
                rmdir $_;
            } else {
                1 while unlink $_; 
            }
               },
    }, 'test') if -d 'test';

rmdir 'test';
[download]

use File::Find;

my @dirs;
my @search_dirs = qw(. ..);

find(\&wanted, @search_dirs);

sub wanted {
    -d && push @dirs, $File::Find::name
}

# do sm.th. with directories in @dirs
[download]

I can delete empty directory with rmdir.
Since if I delete some directory -it's parent directory can
become empty-I need to delete it too.
Thus what I need is loop of deletions of empty directories.
However I want to limit this loop to the maximum
deepness.
Thanks in advance.

use strict;
use File::Find;

my @topdirs = @ARGV;
my @rmdirs;

find( sub { -d and push @rmdirs, $File::Find::name }, @topdirs );

rmdir for reverse @rmdirs;
[download]

use File::Finder;
File::Finder->depth->eval{ sub { rmdir } )->in(@your_top_level_dirs);
[download]

#! /usr/bin/perl -w

use strict;
use File::Find;


my @dirs;

# Process each file that was found
sub wanted {
    # Use your criteria here for what to delete
    if (/foo/) {
        # Delete the file
        unlink $_;

        # Save the dir for later
        push @dirs, $File::Find::dir;
    }
}

# Replace . with your starting dir
find \&wanted, '.';

# Now try to remove the dirs, rmdir will fail if the dir isn't empty
rmdir $_ foreach reverse @dirs;
[download]

Update: oops, just read above node about removing dirs with other dirs inside them. Modified the script to not use the hash for dir path storage, but instead use the reverse list.