diff options
| author | Jimmy Olgeni <olgeni@FreeBSD.org> | 2008-05-23 21:18:39 +0000 |
|---|---|---|
| committer | Jimmy Olgeni <olgeni@FreeBSD.org> | 2008-05-23 21:18:39 +0000 |
| commit | f532e2405a86e1d06101e7f16d1a06c57c38f1e7 (patch) | |
| tree | 493f4b8f11be6f9234c8929e9caa0a69d5907084 /devel/p5-Tree-Binary | |
| parent | 6d4aa839c8cdb87f7568725dc7b86a60214d87b7 (diff) | |
| download | ports-f532e2405a86e1d06101e7f16d1a06c57c38f1e7.tar.gz ports-f532e2405a86e1d06101e7f16d1a06c57c38f1e7.zip | |
Notes
Diffstat (limited to 'devel/p5-Tree-Binary')
| -rw-r--r-- | devel/p5-Tree-Binary/pkg-descr | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/devel/p5-Tree-Binary/pkg-descr b/devel/p5-Tree-Binary/pkg-descr index 4ebebc8e4557..ae2e6ee8fb9f 100644 --- a/devel/p5-Tree-Binary/pkg-descr +++ b/devel/p5-Tree-Binary/pkg-descr @@ -2,11 +2,11 @@ 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, to fill most of your binary tree needs, a true binary tree object -is just easier to mantain and use. +is just easier to maintain and use. Binary Tree objects are especially useful (to me anyway) when building parse trees of things like mathematical or boolean expressions. They can also be used -in games for such things as descisions trees. Binary trees are a well studied +in games for such things as decision trees. Binary trees are a well studied data structure and there is a wealth of information on the web about them. WWW: http://search.cpan.org/dist/Tree-Binary/ |