遍历二叉树有三种方式先序，中序，后序区别就在于访问根节点的顺序先序最先访问根节点，中序第二访问根节点，后序最后访问根节点

用循环双向链表模拟#include#include#includestruct s{ int num; struct s *qian; struct s *hou; int flag;};int n,k,m;int main(){ while(scanf("%d%d%d",&n,&k,&m)!=EOF) { i

#include#include#includeusing namespace std;char s[200];int T;stackS;int main(){ int i,len; scanf("%d",&T); getchar(); while(T--) { gets(s); while(!S.empty(

#include#includeint B1,B2,B3,G1,G2,G3,C1,C2,C3;char str[6][4]={"BCG","BGC","CBG","CGB","GBC","GCB"};int an[6]={0};int main(){ while(scanf("%d%d%d%d%d%d%d%d%d",&B1,&G1,&C1,&B2,&G2,&C2,&B3,&G3