fig11_17.cpp

经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).

  for( R = 0; R <= $\lfloor$log $N\rfloor$; R++ )
      while( $|L_R|$ >= 2 )
      {
          Remove two trees from $L_R$;
          Merge the two trees into a new tree;
          Add the new tree to $L_{R+1}$;
      }