| Display title | Priority search tree |
| Default sort key | Priority search tree |
| Page length (in bytes) | 4,286 |
| Namespace ID | 0 |
| Page ID | 224521 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>CodeMe |
| Date of page creation | 23:32, 9 May 2022 |
| Latest editor | imported>CodeMe |
| Date of latest edit | 23:32, 9 May 2022 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computer science, a priority search tree is a tree data structure for storing points in two dimensions. It was originally introduced by Edward M. McCreight. It is effectively an extension of the priority queue with the purpose of improving the search time from O(n) to O(s + log n) time, where n is... |
