Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re^4: Hierarchical Tree Traversal

by Anonymous Monk
on Jul 16, 2004 at 01:53 UTC ( #374875=note: print w/replies, xml ) Need Help??

in reply to Re^3: Hierarchical Tree Traversal
in thread Hierarchical Tree Traversal

I am afraid I am not versed enough in Perl's complex data structures and Object-Oriented programming to fathom how the module would generate right and left ids without using a parent id as a point of comparison! I just had a chance to look at the code and it calls for explicit usage of all the nodes. To be honest with you, I was looking for a quick and dirty way of building the ids without having to specify explicitly what my nodes are. I'll be happy to use your wonderful module if it would allow me to traverse the tree. In fact, now that you confirmed that it was designed for that purpose, I am planning to re-read the docs again and study your code to see how I can traverse the tree programmatically. I really appreciate your time in developing the module and just wish I was bright enough to understand all its capabilities. Please bear with this poor, un-enlightened monk!

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://374875]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (4)
As of 2021-05-17 18:13 GMT
Find Nodes?
    Voting Booth?
    Perl 7 will be out ...

    Results (159 votes). Check out past polls.