http://qs321.pair.com?node_id=1148960


in reply to Re: Tree Structure Challenge
in thread Tree Structure Challenge

Basically, yes, that's it. One has to be careful with the bordercases, as usually. All leaves have the same distance to the root.
($q=q:Sq=~/;[c](.)(.)/;chr(-||-|5+lengthSq)`"S|oS2"`map{chr |+ord }map{substrSq`S_+|`|}3E|-|`7**2-3:)=~y+S|`+$1,++print+eval$q,q,a,

Replies are listed 'Best First'.
Re^3: Tree Structure Challenge
by LanX (Cardinal) on Nov 30, 2015 at 20:53 UTC
    Yes = you want minimal number of operations?

    Do the diff arrays need to be ordered?

    Cheers Rolf
    (addicted to the Perl Programming Language and ☆☆☆☆ :)
    Je suis Charlie!

      Yes = you don't miss anything. No ordering needed.
      ($q=q:Sq=~/;[c](.)(.)/;chr(-||-|5+lengthSq)`"S|oS2"`map{chr |+ord }map{substrSq`S_+|`|}3E|-|`7**2-3:)=~y+S|`+$1,++print+eval$q,q,a,