二叉树的创建and遍历 作者： Aidan Lew 思路： 用好队列. 代码： #include<iostream> #include<algorithm> #include<queue> #include<cstdio> using namespace std; typedef struct TNode* Position; typedef int ElementType; typedef Position BinTree; /* 二叉树类型 */ struct TNode { /* 树结点定义 */ ElementType D...