<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
a	O
priority	B-Data_Structure
search	I-Data_Structure
tree	I-Data_Structure
is	O
a	O
tree	O
data	O
structure	O
for	O
storing	O
points	O
in	O
two	O
dimensions	O
.	O
</s>
<s>
It	O
is	O
effectively	O
an	O
extension	O
of	O
the	O
priority	B-Application
queue	I-Application
with	O
the	O
purpose	O
of	O
improving	O
the	O
search	O
time	O
from	O
O(n )	O
to	O
O( s	O
+	O
log	O
n	O
)	O
time	O
,	O
where	O
n	O
is	O
the	O
number	O
of	O
points	O
in	O
the	O
tree	O
and	O
s	O
is	O
the	O
number	O
of	O
points	O
returned	O
by	O
the	O
search	O
.	O
</s>
<s>
The	O
priority	B-Data_Structure
search	I-Data_Structure
tree	I-Data_Structure
is	O
used	O
to	O
store	O
a	O
set	O
of	O
2-dimensional	O
points	O
ordered	O
by	O
priority	O
and	O
by	O
a	O
key	O
value	O
.	O
</s>
<s>
This	O
is	O
accomplished	O
by	O
creating	O
a	O
hybrid	O
of	O
a	O
priority	B-Application
queue	I-Application
and	O
a	O
binary	B-Language
search	I-Language
tree	I-Language
.	O
</s>
<s>
The	O
priority	B-Data_Structure
search	I-Data_Structure
tree	I-Data_Structure
can	O
be	O
efficiently	O
queried	O
for	O
a	O
key	O
in	O
a	O
closed	O
interval	O
and	O
for	O
a	O
maximum	O
priority	O
value	O
.	O
</s>
