K-D heap
id:
k-d-heap-306-17150123
title:
K-D heap
text:
A K-D heap is a data structure in computer science which implements a multidimensional priority queue without requiring additional space. It is a generalization of the Heap. It allows for efficient insertion, query of the minimum element, and deletion of the minimum element in any of the k dimensions, and therefore includes the double-ended heap as a special case.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/K-D_heap
date created:
date modified:
2022-03-11T10:12:53Z
main entity:
{"identifier":"Q65045731","url":"https://www.wikidata.org/entity/Q65045731"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/3b/K-d_heap_2_keys.png","width":3473,"height":2010}
fields total:
13
integrity:
14