News Feed

News Archive
Looking for more information on how to do PHP the right way? Check out PHP: The Right Way
Data Structures for PHP Devs Heaps
July 23, 2013 @ 11:10:17 has posted the third part of their "Data Structures for PHP Devs" series today, this time focusing on heaps. Heaps are a method for organizing a parent/child relationship that makes it easier to work with.

In past couple articles I've introduced you to three basic data structures: stack, queue, and tree. In this article I'll introduce you to another abstract data type that is closely related: heap. Heaps are specialized tree-like data structures which satisfy the heap property - the node value (key) of any parent is always ordered with respect to its child node values across the entire tree.

He starts off by explaining what the different types of heaps are - maxheap, minheap and (a special instance) a Priority Queue. He talks about the operations available to heaps and starts off with a binary maxheap implementation using arrays. He also mentions some of the functionality that the SPL already provides for this sort of thing - SplMaxHeap, SplMinHeap and the SplPriorityQueue.

0 comments voice your opinion now!
data structure heap tutorial series spl priority queue


blog comments powered by Disqus

Similar Posts PHP and the i, Part 3

Vance Lucas' Blog: Get Only Public Class Properties for the Current Class in PHP LAMP Installation On Ubuntu 6.06 For Linux Noobs Integrating the Authorize.Net AIM API with PHP

Etienne Kneuss' Blog: SPL Datastructures updated

Community Events

Don't see your event here?
Let us know!

interview library wordpress podcast language project introduction release api framework application bugfix list code series developer laravel threedevsandamaybe community configure

All content copyright, 2014 :: - Powered by the Solar PHP Framework