摘要： 自娱自乐类型，写了个二叉树的遍历 1 #ifndef __TREE_H__ 2 #define __TREE_H__ 3 4 #include <iostream> 5 #include <stack> 6 #include <queue> 7 using std::iostream; 8 using std::cout; 9 using std::endl; 10 using std::stack; 11 using std::queue; 12 13 struct BinaryTreeNode; 14 15 16 typedef void (*BTREE 阅读全文