Skip to content
Skein

heap property

RU: свойство кучи

The rule that makes a binary tree a valid heap: every parent is less than or equal to its children in a min-heap, or greater than or equal to them in a max-heap. Insertions and removals can break it, and sift-up and sift-down restore it.

shortcutsexpand
search
⌘K
prev piece
k
next piece
j
cycle tier
t
this menu
?