Year: 2006
Type: report
Abstract: Tree structures are very often used data structures. Among ordered types of trees there are many variants whose basic operations such as insert, delete, search, delete-min are characterized by logarithmic time complexity. In the article I am going to present the structure whose time complexity for each of the above operations is O(M/K + K), where $M$ is the size of data type and $K$ is constant properly matching the size of data type. Properly matched $K$ will make the structure function as a very effective Priority Queue. The structure size linearly depends on the number and size of elements. PTrie is a clever combination of the idea of prefix tree -- Trie, structure of logarithmic time complexity for insert and delete operations, doubly linked list and queues.
Source: eCommons (Cornell University)
Author: Planeta David
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1797797112
