void Sort_Tree_Succ( Tree T, int i ) { i = Find_Min(T, i); while (i != NULL) { cout << T[value][i] << endl;; i = Successor( T, i ); } }
How implement Find_Min?
How analyze the algorithm?
