8-10-12-02-22.29.c

  一個類比函數,目的在於找到一對節點的最近公用祖先.實現思想是首先將樹映射到一個數組中,跟節點範圍為ROOT,其餘節點範圍為父節點索引,這樣可以輕鬆找到父節點.於是,一個顯而易見的類比函數出現了.

/*8-10-12-02-22.29.c -- 第八章第十題*/</p><p>/*This is a model that can return a proximate communal parent betwen two node*/<br />/*First, map a tree to an array*/</p><p>ElementType FindCommunalParent (const ElementType * const array, const int v, const int w) ;</p><p>ElementType FindCommunalParent (const ElementType * const array, const int v, const int w)<br />{<br />if (ROOT == v || ROOT == w)<br />return FAILED ;<br />if (array[v] < array[w])<br />{<br />while (w != ROOT && array[v] != array[w])<br />w = array[w] ;<br />}<br />else if (array[v] > array[w])<br />{<br />while (v != ROOT && array[v] != arrat[w])<br />v = array[v] ;<br />}<br />else<br />return array[v] ;/*Or array[w]*/<br />}