1# Copyright (c) 2025 Aerlync Labs Inc.
2# SPDX-License-Identifier: Apache-2.0
3
4config MIN_HEAP
5	bool "Min-Heap Data Structure"
6	help
7		Enable support for a generic Min-Heap data structure library.
8
9		A Min-Heap is a binary tree-based data structure in which the
10		smallest element is always at the root. It supports efficient
11		insertion and removal of the minimum element in O(log n) time,
12		making it useful for priority queues, schedulers, and timeout
13		queues.
14
15		This implementation is designed for general-purpose use in both
16		kernel and application code. It supports static and dynamic
17		initialization and allows for custom comparator functions.
18
19		Note: This is unrelated to the kernel's heap memory allocator
20		(used for dynamic memory allocation with `k_malloc()` or
21		`k_heap_alloc()`). The "heap" in Min-Heap refers to the ordering
22		structure, not memory management.
23