C ++ Programming Beauty - France (Listing 3-15) Structure

Listing 3-15

// 层次遍历二叉树
// root，二叉树的根节点
void PrintNodeByLevel(Node* root)
{
     for(int level=0; ; level++)
     {
          if(!PrintNodeAtLevel(root, level)) 
               break;
          cout << endl;
     }
}