PHP AVL binary search tree.
A set of PHP classes implementing binary search trees that comply to AVL rules. The API exposes methods for tree operations (insert, replace, delete, find), and for inorder traversal (find, first, last, prev, next, curr). Tree and traversal operations implement relaxed balance factors, and parent pointer node structures. Hooks for node comparison, error handling and diagnostic logging are provided via a callback interface.
Commercial Use
Modify
Distribute
Place Warranty
Use Patent Claims
Sub-License
Hold Liable
Distribute Original
Disclose Source
Include Copyright
State Changes
Include License
Include Install Instructions
These details are provided for information only. No information here is legal advice and should not be used as such.
30 Day SummaryMar 21 2024 — Apr 20 2024
|
12 Month SummaryApr 20 2023 — Apr 20 2024
|