AVL trees, and timer granularity.

I was reading Eric Schrock's blog and noticed his mention of AVL trees which prompted me to re-visit the topic of data structures.

Another item of note was Eric's explanation of the granular timing methodology found in Solaris 10. I've been running into the briar patch that is pseudo-realtime graphics under windows. Which itself seems to maintain a rough granularity of ~10ms. The number just happens to be the time frame I'm looking to have my thread sleep for. Which means unfortunately, that my thread will probably not be again serviced by the scheduler until well beyond the wanted and expected 10ms. Now there may just be a solution to this, but I don't believe it will be easily had, as I'm using C#.