A heap-ordered tree is a rooted tree containing a set of items, one item in each node, with the items arranged in heap order: If x is any node, then the key of the item in x is no less than the key of the item in its parent p(x), provided x has a parent.
If you want to change selection, open document below and click on "Move attachment"
pdf
owner:
wuerges - (no access) - fredman1987.pdf, p3
Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details