| Title | A fast priority queue |
| Catalog Type | SLCItem |
| Persistent ID | https://codecheck.io/files/horstmann/codecheck-bj-4-tree-105 |
| Platform Name | CodeCheck |
| Features | Code Completion |
| Description | It is possible to provide a fast priority queue implementation if the inserted items have a bounded number of integer priorities. |
| Keywords | Tree Structures |
| Author | Cay Horstmann |
| Institution | San José State University |
| Iframe URL | https://codecheck.io/files/horstmann/codecheck-bj-4-tree-105 |
| Protocol | SPLICE, LTI 1.1 |
| Protocol URL | |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Programming Language | Java |
| Natural Language | en |