二叉树如图所示:
二叉树结构定义如下:
struct TreeNode{
TreeNode(int value):left(NULL),right(NULL),val(value){ }
TreeNode *left;
TreeNode *right;
int val;
};
二叉树前序序列化表示如下:
1 2 4 -1 -1 5 7 -1 -1 -1 3 6 -1 8 -1 -1 -1
-1代表左右孩子为NULL的情况,将序列化的数据存在文件data.txt中,以方便我们读数据。
(一)非递归前序构造二叉树(数据结构:stack)
需要用到一个栈来记录当前的结点,并对当前结点做一个标记(true、false),如果标记为false,代表当前结点刚进栈,需要继续访问当前结点的左孩子;如果为true,代表当前结点的左孩子已经访问过了,需要访问当前结点的右孩子。
void PreoderBuildTree(TreeNode *&root)
{
typedef std::pair<TreeNode*,int> PTI;
int value = -1;
stack<PTI> s;
ifstream ifs("data.txt");
ifs >> value;
if(value != -1) root = new TreeNode(value);
if(root) s.push(PTI(root,false));
PTI *curnode = &s.top();
while(!s.empty()){
while(curnode = &s.top(), curnode->second == false) {
ifs >> value;
if(value == -1) break;
curnode->second = true;
(curnode->first)->left = new TreeNode(value);
s.push(PTI((curnode->first)->left,false));
}
curnode = &s.top();
s.pop();
ifs >> value;
if(value == -1) continue;
(curnode->first)->right = new TreeNode(value);
s.push(PTI((curnode->first)->right, false));
}
ifs.close();
}
(二)非递归前序遍历二叉树(数据结构:stack)
void PreoderTraverseTree(TreeNode *root)
{
if(root == NULL) return;
stack<TreeNode*> s;
s.push(root);
TreeNode *curnode = NULL;
while(!s.empty()){
while(curnode = s.top()) {
std::cout << curnode->val << " ";
s.push(curnode->left);
}
s.pop();
if(!s.empty()){
curnode = s.top();
s.pop();
s.push(curnode->right);
}
}
std::cout << std::endl;
}
(三)递归前序构造二叉树
void PreoderBuildTree_Recur(std::istream &ifs, TreeNode *&root){
int value;
ifs >> value;
if(value == -1) return;
root = new TreeNode(value);
PreoderBuildTree_Recur(ifs, root->left);
PreoderBuildTree_Recur(ifs, root->right);
}
(四)递归前序遍历二叉树
void PreorderTraverseTree_Recur(TreeNode *root){
if(root == NULL) return;
std::cout << root->val << " ";
PreorderTraverseTree_Recur(root->left);
PreorderTraverseTree_Recur(root->right);
}
调用接口 :
int main(void)
{
TreeNode *root_Recur = NULL;
ifstream ifs("data.txt");
PreoderBuildTree_Recur(ifs, root_Recur);
PreoderTraverseTree(root_Recur);
ifs.close();
TreeNode *root = NULL;
PreoderBuildTree(root);
PreorderTraverseTree_Recur(root);
std::cout << std::endl;
}