aboutsummaryrefslogtreecommitdiff
path: root/challenge-125/mark-anderson/perl/ch-2.pl
blob: 806704025124ef970ef592329695d1ab834d1f13 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#!/usr/bin/env perl

use Tree::Binary;
use Modern::Perl;
use List::Util 'max';

=begin example1
    1
   / \
  2   5
 / \ / \
3  4 6  7
       / \
      8  10
     /
    9
=end example1
=cut

my $example1 = Tree::Binary->new('1')
                           ->setLeft(Tree::Binary->new('2')
                           ->setLeft(Tree::Binary->new('3'))
                           ->setRight(Tree::Binary->new('4')))
                           ->setRight(Tree::Binary->new('5')
                           ->setLeft(Tree::Binary->new('6'))
                           ->setRight(Tree::Binary->new('7')
                           ->setLeft(Tree::Binary->new('8')
                           ->setLeft(Tree::Binary->new('9')))
                           ->setRight(Tree::Binary->new('10'))));

say treeDiameter($example1); # 6

sub treeDiameter
{
    my $btree = shift;
    my @diameters;

    $btree->traverse
    (
        sub
        {
            my ($tree) = @_;

            my $leftHeight  = 0;
            my $rightHeight = 0;
 
            if ($tree->hasLeft)
            {
                $leftHeight = $tree->getLeft->height;
            }  

            if ($tree->hasRight)
            {
                $rightHeight = $tree->getRight->height;
            }

            push @diameters, $leftHeight + $rightHeight;
        }
    );

    max @diameters;
}