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 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191
|
#!/usr/bin/perl
use strict;
package B_arbre;
# bintree - binary tree demo program use strict;
my($root, $n);
#########################################
# insert given value into proper point of
# provided tree. If no tree provided,
# use implicit pass by reference aspect of @_
# to fill one in for our caller.
sub insert {
my($tree, $value) = @_;
unless (defined $tree->{VALUE}) {
#$tree = {}; # allocate new node si on met ca, on vient de perdre le pointeur original et le hash se réinitialise
$tree->{VALUE} = $value;
$tree->{LEFT} = undef;
$tree->{RIGHT} = undef;
$_[0] = $tree; # $_[0] is reference param!
return;
}
if ($tree->{VALUE} gt $value) { insert($tree->{LEFT}, $value) }
elsif ($tree->{VALUE} lt $value) { insert($tree->{RIGHT}, $value) }
else { warn "dup insert of $value\n" }
# XXX: no dups
}
# recurse on left child,
# then show current value,
# then recurse on right child.
sub in_order {
my($tree) = @_;
return unless $tree;
in_order($tree->{LEFT});
print $tree->{VALUE}, " ";
in_order($tree->{RIGHT});
}
# show current value,
# then recurse on left child,
# then recurse on right child.
sub pre_order {
my($tree) = @_;
return unless $tree;
print $tree->{VALUE}, " ";
pre_order($tree->{LEFT});
pre_order($tree->{RIGHT});
}
# recurse on left child,
# then recurse on right child,
# then show current value.
sub post_order {
my($tree) = @_;
return unless $tree;
post_order($tree->{LEFT});
post_order($tree->{RIGHT});
print $tree->{VALUE}, " ";
}
# find out whether provided value is in the tree.
# if so, return the node at which the value was found.
# cut down search time by only looking in the correct
# branch, based on current value.
sub search {
my($tree, $value) = @_;
return unless ($tree);
$value =~ s/[\)\(\[]//g;
if ($tree->{VALUE} =~ /$value\s*/) {
return $tree;
}
search($tree->{ ($value lt $tree->{VALUE}) ? "LEFT" : "RIGHT"}, $value)
}
#trouve et renvoie le maximum de deux nombres entiers
sub maximum
{
my ($i,$j) = @_;
my $max;
if($i <= $j)
{
$max = $j;
}
else
{
$max = $i;
}
return $max;
}
#Trouve la hauteur d'un noeud
#reçoit en parametre la reference d'un noeud
sub hauteur
{
my $tree = shift @_;
return -1 unless ($tree);
if(!(exists($tree->{LEFT})) && !(exists($tree->{RIGHT}))) {return 0;}
if(!(exists($tree->{LEFT})) && exists($tree->{RIGHT})) {return 1 + &hauteur($tree->{RIGHT});}
if(exists($tree->{LEFT}) && !(exists($tree->{RIGHT}))) {return 1 + &hauteur($tree->{LEFT});}
else
{
return 1 + &maximum(&hauteur($tree->{RIGHT}),&hauteur($tree->{LEFT}));
}
}
#Faire une rotation simple de l'arbre vers la droite
sub zig_zig_droite
{
my $noeud = shift @_;
my $temp = $noeud->{RIGHT};
$noeud->{RIGHT} = $temp->{LEFT};
$temp->{LEFT} = $noeud;
$noeud = $temp;
return $noeud;
}
#Faire une rotation simple de l'arbre vers la gauche
sub zig_zig_gauche
{
my $noeud = shift @_;
my $temp = $noeud->{LEFT};
$noeud->{LEFT} = $temp->{RIGHT};
$temp->{RIGHT} = $noeud;
$noeud = $temp;
return $noeud;
}
#Faire une rotation double de l'arbre vers la droite
sub zig_zag_droit
{
my $noeud = shift @_;
$noeud->{RIGHT} = zig_zig_gauche($noeud->{RIGHT});
$noeud = zig_zig_droite($noeud);
return $noeud;
}
#Faire une rotation double de l'arbre vers la gauche
sub zig_zag_gauche
{
my $noeud = shift @_;
$noeud->{LEFT} = zig_zig_droite($noeud->{LEFT});
$noeud = zig_zig_gauche($noeud);
return $noeud;
}
#fonction qui equilibre un arbre binaire
sub balance_arbre
{
my $noeud = shift @_;
my $noeud2;
return $noeud unless ($noeud);
if(&hauteur($noeud->{LEFT}) - &hauteur($noeud->{RIGHT}) == 2)
{
print "if 1_1\n";
if(&hauteur($noeud->{LEFT}->{LEFT}) - &hauteur($noeud->{LEFT}->{RIGHT}) == 1)
{
print "if 1_2\n";
$noeud2 = zig_zig_gauche($noeud);
$noeud = $noeud2;
}
if(&hauteur($noeud->{LEFT}->{LEFT}) - &hauteur($noeud->{LEFT}->{RIGHT}) == -1)
{
print "if 1_3\n";
$noeud2 = zig_zag_gauche($noeud);
$noeud = $noeud2;
}
}
if(&hauteur($noeud->{RIGHT}) - &hauteur($noeud->{LEFT}) == -2)
{
print "if 2_1\n";
if(&hauteur($noeud->{LEFT}->{LEFT}) - &hauteur($noeud->{LEFT}->{RIGHT}) == -1)
{
print "if 2_2\n";
$noeud2 = zig_zig_droite($noeud);
$noeud = $noeud2;
}
if(&hauteur($noeud->{LEFT}->{LEFT}) - &hauteur($noeud->{LEFT}->{RIGHT}) == 1)
{
print "if 2_3\n";
$noeud2 = zig_zag_droite($noeud);
$noeud = $noeud2;
}
}
return $noeud;
}
1; |
Partager