二叉树层次遍历

按层次遍历树中结点



  
    

   
     void
   
      LayerOrderTraverse(BiNode
   
     *
   
      T)
{
 Queue
   
     <
   
     Node 
   
     *>
   
      q;
 
   
     if
   
     (NULL 
   
     ==
   
      T) 
 
   
     return
   
     ;
 q.push(T);
 
   
     while
   
     (
   
     !
   
     q.isEmpty())
 {
 T 
   
     =
   
      q.pop();
 printf(
   
     "
   
     %d 
   
     "
   
     ,T
   
     ->
   
     data);
 
   
     if
   
     (T
   
     ->
   
     lchild)
 q.push(T
   
     ->
   
     lchild);
 
   
     if
   
     (T
   
     ->
   
     rchild)
 q.push(T
   
     ->
   
     rchild);
 }
}