#! perl -slw
use strict;
use Data::Dump qw[ pp ];
use List::Util qw[ reduce ];
use enum qw[ NAME FREQ LEFT RIGHT ];

our $N //= 1;

my$n = 0;
my @heap = map{
    $_->[LEFT] = ++$n;
    $_->[RIGHT] = ++$n;
    $_;
} sort {
    $a->[FREQ] <=> $b->[FREQ]
} map[
    $_ , int( rand 1000 )
], 'A'x$N .. 'Z'x$N;;

my @tree = map {
$_->[LEFT] = $heap[ $_->[LEFT] ], $_->[RIGHT] = $heap[ $_->[RIGHT] ]
} @heap;

pp \@tree;