void Sort_Tree( Tree T, int i ) { if( i == NULL ) { return ; } Sort_Tree(T, T[left][i]); cout << T[value][i] << endl;; Sort_Tree(T, T[right][i]); return; }
Running time? How prove this?
