**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.08 - 17 Jul 2016 04:43:41 UTC**Tree::Binary::XS - Perl extension for manipulating binary tree structure**

Please note this extension is not compatible with the Tree::Binary package, this module was redesigned and simplified the interface of manipulating tree structure....

YOANLIN/Tree-Binary-XS-0.03 - 07 Apr 2015 14:57:29 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.08 - 17 Jul 2016 04:43:41 UTC**Tree::Binary::Dictionary - A dictionary API to a binary tree**

A simple class to provide a dictionary style API to a binary tree of data. This can provide a useful alternative to a long-lived hash in long running daemons and processes....

TEEJAY/Tree-Binary-Dictionary-1.01 - 17 Jul 2006 10:13:46 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.08 - 17 Jul 2016 04:43:41 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.08 - 17 Jul 2016 04:43:41 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.08 - 17 Jul 2016 04:43:41 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.08 - 17 Jul 2016 04:43:41 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.08 - 17 Jul 2016 04:43:41 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.08 - 17 Jul 2016 04:43:41 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.08 - 17 Jul 2016 04:43:41 UTC**Tree::Visualize::ASCII::Layouts::Binary - A base class for Tree::Binary and Tree::Binary::Search layouts**

STEVAN/Tree-Visualize-0.01 - 15 Nov 2004 22:18:34 UTC

**Tree::Visualize::GraphViz::Layouts::Binary::Tree**

STEVAN/Tree-Visualize-0.01 - 15 Nov 2004 22:18:34 UTC

**Tree::Binary2 - An implementation of a binary tree**

This is an implementation of a binary tree. This class inherits from Tree, which is an N-ary tree implemenation. Because of this, this class actually provides an implementation of a complete binary tree vs. a sparse binary tree. The empty nodes are i...

RSAVAGE/Tree-1.14 - 03 Jun 2019 23:43:11 UTC**Tree::Visualize::ASCII::Layouts::Binary::TopDown - A TopDown Tree::Binary and Tree::Binary::Search layout**

STEVAN/Tree-Visualize-0.01 - 15 Nov 2004 22:18:34 UTC

**Tree::Visualize::ASCII::Layouts::Binary::Diagonal - A Diagonal Tree::Binary and Tree::Binary::Search layout**

STEVAN/Tree-Visualize-0.01 - 15 Nov 2004 22:18:34 UTC

**Tree::Visualize::ASCII::Layouts::Binary::LeftSide**

STEVAN/Tree-Visualize-0.01 - 15 Nov 2004 22:18:34 UTC

**Tree::Visualize::ASCII::Layouts::Binary::BottomUp**

STEVAN/Tree-Visualize-0.01 - 15 Nov 2004 22:18:34 UTC

**Tree::Visualize::ASCII::Layouts::Binary::RightSide**

STEVAN/Tree-Visualize-0.01 - 15 Nov 2004 22:18:34 UTC

**lib/RPerl/DataStructure/Graph/Tree/Binary/Node.pm**

WBRASWELL/RPerl-7.000000 - 05 Jul 2020 01:35:58 UTC