Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Viewing Data Structures

by screamingeagle (Curate)
on Jul 21, 2002 at 03:29 UTC ( #183743=note: print w/replies, xml ) Need Help??

in reply to Viewing Data Structures

check out Data::Denter ... It's a nice alternative to Data::Dumper

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://183743]
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)
[LanX]: oh I meant fixed amount
[LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
[LanX]: simple recursive function which goes left and right till l or r are exhausted
LanX #solved
[oiskuu]: I must watch Police Academy again sometime.

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2018-03-19 11:24 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.