学步园

  呵呵.单独开个文章,纯属广告啊.不过,内容倒是货真价实的.

Node * Search (const Item min, const Item max) ;</p> <p>Node * IntervalTree :: m_Search (Node * pn) const<br /> {<br /> Node * pMinMin ; </p> <p> if (pn)<br /> {<br /> if (pn -> left && pn -> left -> maxOfAll >= m_min)<br /> {<br /> pMinMin = m_Search (pn -> left) ;<br /> if (pMinMin)<br /> return pMinMin ;<br /> else if (m_Overlap (pn -> min, pn -> max))<br /> return pn ;<br /> else<br /> return NULL ;<br /> }<br /> else if (m_Overlap (pn -> min, pn -> max))<br /> return pn ;<br /> else<br /> return m_Search (pn -> right) ;<br /> }<br /> else<br /> return NULL ;<br /> } </p> <p>Node * IntervalTree :: Search (const Item min, const Item max)<br /> {<br /> m_min = min ;<br /> m_max = max ;</p> <p> return m_Search (m_root) ;<br /> }<br />