Added solution ch-2.pl

2 files changed, 38 insertions, 0 deletions

diff --git a/challenge-056/manfredi/README b/challenge-056/manfredi/README
new file mode 100644
index 0000000000..dfb0471044
--- /dev/null
+++ b/challenge-056/manfredi/README
@@ -0,0 +1 @@
+Solution by Leo Manfredi
diff --git a/challenge-056/manfredi/perl/ch-2.pl b/challenge-056/manfredi/perl/ch-2.pl
new file mode 100755
index 0000000000..f6a92f919c
--- /dev/null
+++ b/challenge-056/manfredi/perl/ch-2.pl
@@ -0,0 +1,37 @@
+#!/usr/bin/env perl
+
+# use v5.24;
+use strict;
+use Data::Dumper;
+
+binmode STDOUT, ":utf8";
+
+my $sum_ok = 22;
+
+sub preorder($$) {
+    my $t = shift or return;
+    my @path = @{+shift};
+    
+    push @path, $t->[0];
+
+    if ( ! $t->[1]  && ! $t->[2] ) { # Is a leaf
+        my $sum = 0;
+        for(@path) {$sum += $_; }
+        my $path = join ' '.chr(0x2794).' ', @path;
+        my $ok = $sum == $sum_ok ? chr(0x221A) : chr(0x2022);
+        printf "$ok sum [$sum] for path: $path\n";
+        
+    } else {
+        preorder($t->[1], \@path); # if $t->[1];
+        preorder($t->[2], \@path); # if $t->[2];
+    }
+
+}
+
+# [Node-Left-Right]
+my $tree = [ 5, [ 4, [ 11, [7], [2] ] ], [ 8, [13], [ 9, [1] ] ] ];
+
+#print Dumper($tree);
+
+preorder($tree, []);
+