fb16dfecae
Commit b7f05445c0 has added WWW entries to port Makefiles based on
WWW: lines in pkg-descr files.
This commit removes the WWW: lines of moved-over URLs from these
pkg-descr files.
Approved by: portmgr (tcberner)
9 lines
553 B
Text
9 lines
553 B
Text
Tree::RedBlack is a perl implementation of the Red/Black tree algorithm found in
|
|
the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly known as
|
|
"CLR" or "The White Book"). A Red/Black tree is a binary tree which remains
|
|
"balanced"- that is, the longest length from root to a node is at most one more
|
|
than the shortest such length. It is fairly efficient; no operation takes more
|
|
than O(lg(n)) time.
|
|
|
|
A Tree::RedBlack object supports the following methods: new(), root(), cmp(&),
|
|
insert($, $), delete($), find($), node($), min() and max().
|