ForA

摘要： 按层次遍历树中结点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); }} 阅读全文