Req #51565 [Com]: PHP Spl(Binary)Tree Structure

From: Date: Wed, 22 Apr 2020 07:09:55 +0000
Subject: Req #51565 [Com]: PHP Spl(Binary)Tree Structure
References: 1  Groups: php.bugs 
Request: Send a blank email to php-bugs+get-226709@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: alexinbeijing 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: I suggest this request can be closed. Previous Comments: ------------------------------------------------------------------------ [2011-12-13 02:57:56] morrison dot levi at gmail dot com 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. ------------------------------------------------------------------------ [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

« previous php.bugs (#226709) next »