Re^2: Tree Structure Challenge


We don't bite newbies here... much
	PerlMonks

by choroba (Cardinal)

on Nov 30, 2015 at 20:50 UTC ( [id://1148960]=note: print w/replies, xml )

Need Help??

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,
[download]

Comment on Re^2: Tree Structure Challenge Download Code

Replies are listed 'Best First'.
Re^3: Tree Structure Challenge by LanX (Saint) 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!}	[reply]
Re^4: Tree Structure Challenge by choroba (Cardinal) on Nov 30, 2015 at 21:03 UTC
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, [download]	[reply] [d/l]

In Section Meditations

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://1148960]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others having an uproarious good time at the Monastery: (3)

As of 2024-04-23 06:57 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found