This software provides a swift implementation of a tree using pure Perl programming language.
If you're looking for the fastest implementation of a tree written in pure Perl, then Tree::Fast is the one for you. To get started, simply create a new tree using the 'new' method and add child nodes using 'add_child'. We've included examples of adding the first and last child nodes using an index of 0 and -1 respectively. You can also retrieve specific ranges of child nodes using 'children'.
If you need to remove child nodes, the 'remove_child' method makes it easy. When you're ready to traverse the tree, you can do so in either pre-order or post-order using the 'traverse' method. We've provided a simple example of a post-order traversal that returns nodes one at a time.
For more convenience methods and error-checking, you may want to try the Tree wrapper around Tree::Fast instead. But if pure speed is your top priority, Tree::Fast won't disappoint. Give it a try and see for yourself.
If you need to remove child nodes, the 'remove_child' method makes it easy. When you're ready to traverse the tree, you can do so in either pre-order or post-order using the 'traverse' method. We've provided a simple example of a post-order traversal that returns nodes one at a time.
For more convenience methods and error-checking, you may want to try the Tree wrapper around Tree::Fast instead. But if pure speed is your top priority, Tree::Fast won't disappoint. Give it a try and see for yourself.
What's New
Version 1.01: N/A