Left c f b vright cbf r properties each

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: = {a, e} • R = {d} 6 f v 4 7 L • v.left = {c, f, b} • v.right = {c,b,f} R Properties • • • • • Each interval is stored in exactly one node. Each node stores between 1 and n intervals. Number of nodes is O(n). Sum of sizes of left and right lists is O(n). Tree height depends on how you choose the points v.pt. Selection of v.pt • v is the median of the end points of the intervals stored in the subtree rooted at v. 1e 2 2 1 3 c 4 5 d 3 4 b 6 a 6 f • End points = {1, 2, 3, 4, 5, 6} • Use either 3 or 4 as v.pt. 7 Selection of v.pt • With median selection, tree height is O(log n). • Median selection is possible only for static interval se...
View Full Document

Ask a homework question - tutors are online