LLRB Tree
| Recommend this page to a friend! |  Stumble It! |
 Bookmark in del.icio.us |
| Author | ||
 |
|
Innovation award Nominee: 1x | |||||||||||||||||||
This package can be used to manage a balanced tree of text word nodes.
It implements a left leaning Red-Black binary search tree that uses Node objects instead of arrays to implement the tree data structures.
It can perform operations on nodes of text words like insert, search, delete and traverse the tree, maintaining a balanced and correctly formed tree after each operation. This makes it perfect for creating efficient symbol tables and dictionaries.
It implements a left leaning Red-Black binary search tree that uses Node objects instead of arrays to implement the tree data structures.
It can perform operations on nodes of text words like insert, search, delete and traverse the tree, maintaining a balanced and correctly formed tree after each operation. This makes it perfect for creating efficient symbol tables and dictionaries.
| Classes of Jay Wheeler | > | LLRB Tree | > | Download .zip .tar.gz | > |  Support forum |
> |  Blog |
> |   Latest changes |
||
|
|||||||||||||||||||||||
| Groups |  User ratings |
Trackback | Applications |  Files |
||||||
| Groups | ||
 |
PHP 5 | Classes using PHP 5 specific features | View top rated classes |
|
Data types | Modeling and manipulating data types | View top rated classes |
| Innovation Award | ||
 August 2009 Number 6 Prize: One copy of VS.PHP |
Red-Black trees are data structures are self-balancing trees that can be used to implement binary search algorithms. This class provides a pure PHP implementation of this kind of trees. Manuel Lemos |
| User ratings | ||
| There are not enough user ratings to display for this class. |
| Trackback links | ||
| Link | Description |
|---|---|
| Tree | Robert Sedgewick (Department of Computer Science, Princeton University) published a very good algorithm, complete with detailed explanation, of creating and maintaining 2-3 and 2-3-4 binary trees, called Left Leaning Red Black Binary Trees (LLRB)... |
| Applications that use this class | ||
No application links were specified for this class.
If you know an application of this package, send a message to the author to add a link here.| Files |
||
| File | Role | Description |
|---|---|---|
| bNode.php |
Class | Binary node abstract base class |
| bTree.php |
Class | Binary tree abstract base class |
| iComparable.php |
Class | An interface to compare two objects |
 License |
Lic. | Statement of Copyright |
| LLRBNode.php |
Class | Implementation of the bNode class for LLRB nodes |
| LLRBTree.php |
Class | Implementation of the bTree class for LLRB Tree |
| ReadMe |
Doc. | Short description of the source of (most) of the algorithms |
| testLLRBTree.php |
Example | A test application to prove the correct operation of the LLRB tree |
| testLLRBTreeResults |
Output | Sample output from running testLLRBTree.php |
| Download all files: llrbtree.tar.gz llrbtree.zip |
For more information send a message to info at phpclasses dot org.
Copyright (c) Icontem 1999-2013