C如何用递归分层遍历树？

Question

如题。

Answer 1

这个可难了 

Answer 2

大概就是这样，里面可能有写细节的东东我没写全，你可以看懂思路之后自己写一下void PrintNodeAtLevel(BiTree T,int level)  {          if (NULL == T || level < 1 ) 5                 return;          if (1 == level){                 cout << T->data << "  "；                return;         }         PrintNodeAtLevel(T->leftChild,  level - 1);         PrintNodeAtLevel(T->rightChild, level - 1); }void LevelTraverse(BiTree T) {          if (NULL == T){                return;          }          int depth = Depth(T);          int i;          for (i = 1; i <= depth; i++) {                   PrintNodeAtLevel(T, i);                   cout << endl;          }}