Section 30.9 Vocabulary
- binary tree
- A tree in which each node has at most two children.
- complete tree
- A tree in which all levels are completely filled except possibly the last level, which must be filled from left to right.
- heap
- A complete binary tree where each node is smaller than or equal to its children (min-heap) or larger than or equal to its children (max-heap).
- heap property
- The property that a heap must satisfy, which is that each node is smaller than or equal to its children (min-heap) or larger than or equal to its children (max-heap).
- height (tree)
- The number of edges on the longest path from the root to a leaf in a tree.
- max heap
- A heap where every node is larger than or equal to its children and thus the largest value is at the top.
- min heap
- A heap where every node is smaller than or equal to its children and thus the smallest value is at the top.
- priority queue
- A data structure that maintains a set of elements with associated priorities and allows for efficient retrieval of the highest (or lowest) priority element.
- shape property (heap)
- The property that a heap must satisfy, which is that all levels of the tree are filled except possibly the last level, which must be filled from left to right.
- tree
- A data structure consisting of nodes connected by edges. Each node has exactly one parent (node that points to it), except for the root node.
You have attempted of activities on this page.
