Req #51565 [Com]: PHP Spl(Binary)Tree Structure
| From: | morrison dot levi at gmail dot com | Date: | Tue, 13 Dec 2011 02:57:56 +0000 |
| Subject: | Req #51565 [Com]: PHP Spl(Binary)Tree Structure | ||
| References: | 1 | Groups: | php.bugs |
| Request: | Send a blank email to php-bugs+get-165832@lists.php.net to get a copy of this message | ||
Edit report at https://bugs.php.net/bug.php?id=51565&edit=1
ID: 51565
Comment by: morrison dot levi at gmail dot com
Reported by: clintonxa at gmail dot com
Summary: PHP Spl(Binary)Tree Structure
Status: Open
Type: Feature/Change Request
Package: SPL related
Operating System: All
PHP Version: 5.3.2
Block user comment: N
Private report: N
New Comment:
Honestly, heaps are just a representation of trees. I know that particular
benefits are associated with trees and others with heaps, but generally speaking
you could probably just use a heap.
Previous Comments:
------------------------------------------------------------------------
[2010-04-15 23:35:49] clintonxa at gmail dot com
Description:
------------
SPL has so far included several very useful structures, and another basic one that we would benefit
from is a tree structure.
It is possible to use an array for this now, but an SPL class would be beneficial.
Test script:
---------------
<?php
$btree = new SplBinaryTree(BTREE_SORT_NUMERIC);
$btree->add(4);
$btree->add(10);
$btree->add(2);
// Well, I'm not sure on how PHP devs would implement the tree's methods.
// But a quick browse through any intro to OOP guide will give some ideas.
?>
------------------------------------------------------------------------
--
Edit this bug report at https://bugs.php.net/bug.php?id=51565&edit=1