|  support |  documentation |  report a bug |  advanced search |  search howto |  statistics |  random bug |  login
Request #51565 PHP Spl(Binary)Tree Structure
Submitted: 2010-04-15 23:35 UTC Modified: 2017-10-24 08:10 UTC
Avg. Score:4.7 ± 0.5
Reproduced:6 of 6 (100.0%)
Same Version:4 (66.7%)
Same OS:6 (100.0%)
From: clintonxa at gmail dot com Assigned:
Status: Open Package: SPL related
PHP Version: 5.3.2 OS: All
Private report: No CVE-ID: None
View Add Comment Developer Edit
Welcome! If you don't have a Git account, you can't do anything here.
You can add a comment by following this link or if you reported this bug, you can edit this bug over here.
Block user comment
Status: Assign to:
Bug Type:
From: clintonxa at gmail dot com
New email:
PHP Version: OS:


 [2010-04-15 23:35 UTC] clintonxa at gmail dot com
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:

$btree = new SplBinaryTree(BTREE_SORT_NUMERIC);

// 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.



Add a Patch

Pull Requests

Add a Pull Request


AllCommentsChangesGit/SVN commitsRelated reports
 [2010-06-10 18:18 UTC]
-Package: Class/Object related +Package: SPL related
 [2011-12-13 02:57 UTC] 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.
 [2014-03-27 15:20 UTC]
-Assigned To: +Assigned To: levim
 [2017-10-24 08:10 UTC]
-Status: Assigned +Status: Open -Assigned To: levim +Assigned To:
 [2020-04-22 07:09 UTC] alexinbeijing at gmail dot com
I suggest this request can be closed.
PHP Copyright © 2001-2021 The PHP Group
All rights reserved.
Last updated: Wed Jul 28 15:01:23 2021 UTC