队列代码:
链接:队列代码。
遍历层序二叉树:
//层序遍历voidbtreelevelorder(btree*root ) {queue* qe; init(QE ); if (根) )推(QE,根); (while ) ) QE!=null}{btree*QEnode=top(QE ); pop(QEnode ); printf('%d ',qenode-_data ); if (根- _ left )推) QE,根- _ left; if(root-_right ) push ) QE,root-_right; }