k-ary heap (Q29791673)
Jump to navigation
Jump to search
complete tree data structure where every node has a key more extreme (greater or less) than the key of its parent
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-ary heap |
complete tree data structure where every node has a key more extreme (greater or less) than the key of its parent |