Is it possible to elegantly create a range over a binary heap?

[Gary Willoughby via Digitalmars-d-learn]

On Sunday, 27 December 2015 at 17:23:35 UTC, Gary Willoughby 
wrote:
> I have a binary tree storing ints implemented using an array. 
> The internal state looks like this:
>
> 8,7,6,4,1,3,5,2
>
> When extracting this data, it is returned as 8,7,6,5,4,3,2,1.
>
> Is it possible to elegantly add a range on top of the internal 
> state to return the correct value order I would expect when 
> extracting? Is there an algorithm documented somewhere for 
> doing this?

Some explanatory reference:

https://en.wikipedia.org/wiki/Binary_tree#Arrays