Search results for "dist:Tree-Binary BINARY"
Tree::Binary - An Object Oriented Binary Tree for Perl
This module is a fully object oriented implementation of a binary tree. Binary trees are a specialized type of tree which has only two possible branches, a left branch and a right branch. While it is possible to use an *n*-ary tree, like Tree::Simple...
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Binary::Search - A Binary Search Tree for perl
This module implements a binary search tree, which is a specialized usage of a binary tree. The basic principle is that all elements to the left are less than the root, all elements to the right are greater than the root. This reduces the search time...
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Binary::Search::Node - A node for a Tree::Binary::Search tree
This is a subclass of Tree::Binary and is mostly used by Tree::Binary::Search....
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Binary::Visitor::Base - A Visitor base class for Tree::Binary::Visitor::* objects
This is a base class for Tree::Binary::Visitor objects. If you want to create your own visitor object, just subclass this and create a visit method....
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Binary::VisitorFactory - A factory object for dispensing Visitor objects
This object is really just a factory for dispensing Tree::Binary::Visitor::* objects. It is not required to use this package in order to use all the Visitors, it is just a somewhat convienient way to avoid having to type thier long class names. I con...
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Binary::Visitor::InOrderTraversal - Visitor object for Tree::Binary objects
Post-order traversal is a variation of the depth-first traversal in which the left sub-tree is processed, followed by tree itself, then the right sub-tree. It is another alternative to Tree::Binary's traverse method and it's depth-first, pre-order tr...
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Binary::Visitor::PreOrderTraversal - Visitor object for Tree::Binary objects
For the most part, this class is just a wrapper around the Tree::Binary "traverse" method....
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Binary::Visitor::PostOrderTraversal - Visitor object for Tree::Binary objects
Post-order traversal is a variation of the depth-first traversal in which the sub-tree's are processed before the parent. It is another alternative to Tree::Binary's traverse method which implements a depth-first, pre-order traversal....
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC
Tree::Binary::Visitor::BreadthFirstTraversal - Visitor object for Tree::Binary objects
This implements a breadth-first traversal of a Tree::Binary object. This can be an alternative to the built in depth-first traversal of the Tree::Binary traverse method....
RSAVAGE/Tree-Binary-1.09 - 01 Feb 2021 23:46:40 UTC