Re: Tree Structure Challenge


Clear questions and runnable code get the best and fastest answer
	PerlMonks

Re: Tree Structure Challenge

by LanX (Cardinal)

on Nov 30, 2015 at 20:47 UTC ( #1148959=note: print w/replies, xml )

Need Help??

in reply to Tree Structure Challenge

I'm not sure if I get the problem, the naive solution is to collect all nodes from each tree with successive ->Parent calls and to construct the difference with cut operations. (like deleting hash slices)

What am I missing?

If the goal is to have minimal numbers of operations, we'd need to know things like if all leaves have the same distance to root.

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)

Je suis Charlie!}

Comment on Re: Tree Structure Challenge

Replies are listed 'Best First'.
Re^2: Tree Structure Challenge by choroba (Archbishop) on Nov 30, 2015 at 20:50 UTC
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]	[reply] [d/l]
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!}	[reply]
Re^4: Tree Structure Challenge by choroba (Archbishop) 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

Node Status^?

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

Chatterbox^?

How do I use this? | Other CB clients

Other Users^?

Others pondering the Monastery: (5)

As of 2021-03-07 03:38 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

Notices^?