二叉树三种非递归遍历的区别
摘要:1 #include <iostream> 2 3 #define MAXN 100 4 using namespace std; 5 6 7 struct BTNode 8 { 9 char tag; 10 BTNode *left; 11 BTNode *right; 12 }; 13 14 class BTree 15 { 16 private: 17 BTNode **root; 18 void BuildBTree(BTNode **root); 19 20 public: 21 /*递归版本*/ 22 ...
阅读全文
posted @
2012-07-05 15:21
Seiyagoo
阅读(1569)
推荐(1)