c++构造二叉树

本代码实例中，使用了模板的知识，方便更改树节点中的元素类型。

//二叉树的创建和层序遍历
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

template <typename T>
struct TreeNode {
    T data;
    TreeNode *left;
    TreeNode *right;
    TreeNode(T x) {
        data = x;
        left = NULL;
        right = NULL;
    }
};

//传入节点值的数组
template <typename T>
TreeNode<T>* ConstructBinaryTree(const vector<T>& vec , T sign) {
    vector<TreeNode<T>*> vectree(vec.size(),NULL);
    TreeNode<T>* root =  vectree[0];
    for (int i = 0; i < vec.size(); i++) {
        TreeNode<T>* node = NULL; //注意node一定要赋初值，否则是野指针，可能会导致代码出现问题
        if (vec[i] != sign) {
            node = new TreeNode<T>(vec[i]);
        } 
        if (i == 0) root = node;
        vectree[i] = node;
    }
    for (int i = 0; i * 2 + 1 < vec.size(); i++) {
        if (vectree[i] != NULL) {
            vectree[i]->left = vectree[i * 2 + 1];
            if (i * 2 + 2 < vec.size()) {
                vectree[i]->right = vectree[i * 2 + 2];
            }
        }
    }
    for (int i = 0; i < vectree.size(); i++) {
        cout << vectree[i] << " ";
    }
    cout << endl;
    cout<<"构造完成！"<<endl;
    return root;
}

//层序遍历二叉树
template <typename T>
void BinaryPrint(TreeNode<T>* root , T sign) {
    queue<TreeNode<T>*> Q;
    if (root != NULL){
        Q.push(root);
    }
    //vector<vector<T>> result;
    while(!Q.empty()) {
        int size = Q.size();
        vector<T> Numvec;
        for (int i = 0; i < size; i++) {
            TreeNode<T>* node = Q.front();
            Q.pop();
            if (node != NULL) {
                Numvec.push_back(node->data);
                Q.push(node->left);
                Q.push(node->right);
            }
            else Numvec.push_back(sign);
        }
        for (int j = 0; j < Numvec.size(); j++) {
            cout << Numvec[j] << " ";
        }
        cout << endl;
    }
}

int main() {
     vector<char> vec = {'4','1','6','0','2','5','7','n','n','n','3','n','n','n','8'};
     TreeNode<char>* root = ConstructBinaryTree(vec , 'n');
     cout<< "根节点元素为：" << root->data <<endl;
     cout << "层序遍历结果为：" << endl;
     BinaryPrint(root , 'n');
}