二叉树的非递归遍历,我的思路 #ifndef UTILS_H_INCLUDED #define UTILS_H_INCLUDED #include <iostream> using namespace std; #define TreeNum 10 //默认十个结点,创建一个完全二叉树 typedef struct node { int data; struct node *lchild; struct node *rchild; node(){}; node(int data) { this->data = data; } } NODE; //创建...
