Home > Term: binary priority queue
binary priority queue
A priority queue implemented with a binary tree having the following restrictions:
- The key of a node is greater than keys of its children, i.e., it has the heap property.
- If the right subtree is not empty, the left subtree is not empty.
- If there are both left and right children, the left child's key is greater than the right child's key.
- ส่วนหนึ่งของคำพูด: noun
- อุตสาหกรรม/ขอบเขต: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
ผู้สร้าง
- GeorgeV
- 100% positive feedback