lec36 - Priority Search Trees Keys are distinct ordered...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Priority Search Trees Keys are distinct ordered pairs (x i , y i ) . Min tree on y . Search tree (almost) on x . Two varieties. Search tree is a balanced binary search tree such as a red-black tree. Red-black Priority Search Tree (RBPST) Search tree is a radix search tree. Radix Priority Search Tree (RPST)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Radix Priority Search Tree All x values are different, integral, and in the range [0, k – 1] . Each node of the priority search tree has exactly one element. The y value of the element in node w is <= the y value of all elements in the subtree rooted at w ( y values define a min tree). Root interval is [0,k) . Interval for node w is [a,b) . Left child interval is [a, floor((a+b)/2)) . Right child interval is [floor((a+b)/2, b)) .
Background image of page 2
Start with empty RPST. k = 16 . Root interval is [0,16) . Insert (5,8) . Insert (6,9) . (5,8)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 17

lec36 - Priority Search Trees Keys are distinct ordered...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online