홈 > Term: k-ary heap
k-ary heap
A complete tree where every node has a key more extreme (greater or less) than the key of its parent. Each node has k or fewer children.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
-
(Gold) 1123 포인트 - 100% positive feedback
